Skip to content

Erdős problem 123

Start work

Let a,b,c>1a,b,c>1 be pairwise coprime integers. Is every large integer a sum of distinct numbers of the form akblcma^k b^l c^m (k,l,m≥0k,l,m\ge 0), none dividing another?

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:5ae4c555d851104f9e27141bed2478ea01804d1f1fbdf8ea50b0fc53fb84fc9f
Metadata
sha256:b0cdd9891b5b66d24148ef2427e87b3c7af8aa87ee14111af9c1689f50985cea
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:d945119861004d34f9fdcd98130c25877f9083dc056b47efdfc06bf895bcde4b
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON