Skip to content

Erdős problem 246

Let (a,b)=1(a,b)=1. The set {akbl:k,l0}\{a^kb^l: k,l\geq 0\} is complete - that is, every large integer is the sum of distinct integers of the form akbla^kb^l with k,l0k,l\geq 0.

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:e791edac46804dbf4d4cf98439266664f31d21ee8c29b38cf80fa01b5ca74e74
Metadata
sha256:b7e12629dd920c363a471645e36be799331f51cedd1eab5ec7643ae78a7e2c0f
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:c3f1c6f0086893b298f79890a7324b87f8708093f2a90bc36da916a1d2b47995
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page