Erdős problem 942 · problems.science

Let $h(n)$ count powerful integers in $[n^2, (n+1)^2)$ . What is the extremal order of $h(n)$ ?

Sources

Browse retained paths and inspect the exact material available for this Problem.

4 retained statements2415f78e850a

FormalConjectures/ErdosProblems/

942.lean

Retained formal statement3 of 3

It is not hard to prove that $\limsup h(n) = \infty$ .

FormalConjectures/ErdosProblems/942.leanErdos942.erdos_942.variants.limsup1 lineExact file

1Filter.limsup ((fun n => ↑n) ∘ Erdos942.erdos_942.h) Filter.atTop = ⊤

TextbookStatement only, no proof