**Erdős Problem #123**
Let $a, b, c$ be three integers which are pairwise coprime. Is every large integer
the sum of distinct integers of the form $a^k b^l c^m$ ($k, l, m ≥ 0$), none of which
divide any other?
Equivalently: is the set $\{a^k b^l c^m : k, l, m \geq 0\}$ d-complete?
Note: For this not to reduce to the two-integer case, we need the integers
to be greater than one and distinct.
Actions
Submit a Proof
Have a proof attempt? Submit it for zero-trust verification.
