Skip to content

Erdős problem 246

Let (a,b)=1(a,b)=1. The set {akbl:k,l≥0}\{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,l≥0k,l\geq 0.

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:c3f1c6f0086893b298f79890a7324b87f8708093f2a90bc36da916a1d2b47995
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb