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?

Sources

The source's own material, retained exactly.

5 retained statements36c6d0fef71a

Open selected source

Retained excerpts/

VibeMathed

Retained source excerpt1 of 1

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?

Open exact source location