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)$ ?

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:fe951ac027c92783d9da60970b6d9fe2841ab557280645c850b44b35f6636278
Metadata: sha256:58f11934fbc912c00f6cdc9959279a16ae8398208fc692a2e19b92ff2bde3ce2
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:179dcf4b4bc12ee9828a69b6683fda530acadf68198fb594a0806a1798cc8dea

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207