Erdős Problem #942
Prior state unknown→proved
lower bound improved to ≫ log n/(log log n · log log log n) infinitely often; the extremal order remains open
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theory / Number Theory, Powerful Numbers
Erdős Problem #942
Let $h(n)$ count powerful integers in $[n^2, (n+1)^2)$. What is the extremal order of $h(n)$?
10Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts
Temporal state
Current frontier
No reconciled state yet.
Append-only history
Frontier timeline
Research memory
Claims and attempts
Scoped claims
Let $h(n)$ count powerful integers in $[n^2, (n+1)^2)$. What is the extremal order of $h(n)$?
lower bound improved to ≫ log n/(log log n · log log log n) infinitely often; the extremal order remains open
Recorded attempts
Evidence graph
Connected research record
No public relationships recorded yet.