Erdős problem 123 · problems.science

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

Browse retained paths and inspect the exact material available for this Problem.

5 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

123.lean

Retained formal statement2 of 4

Erdős and Lewin [ErLe96] proved this conjecture when $a = 3$ , $b = 5$ , and $c = 7$ .

FormalConjectures/ErdosProblems/123.leanErdos123.erdos_123.variants.erdos_lewin_3_5_71 lineExact file

1Erdos123.IsDComplete (↑(Submonoid.powers 3) * ↑(Submonoid.powers 5) * ↑(Submonoid.powers 7))

SolvedStatement only, no proof

Sources

Search problems.science