Erdős problem 123
Let be pairwise coprime integers. Is every large integer a sum of distinct numbers of the form (), none dividing another?
Sources
Retained excerpts/
VibeMathed
Retained source excerpt
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