Skip to content

Erdős problem 123

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,m0k,l,m\ge 0), none dividing another?

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:d945119861004d34f9fdcd98130c25877f9083dc056b47efdfc06bf895bcde4b
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page