number-theory / Number Theory

Erdős Problem #123

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

11Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

number-theoryJul 1, 2026Significance 11/100Registry: lean verified

Erdős Problem #123

Prior state unknownproved

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

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

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

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.