Skip to content

Erdős problem 942

Start work

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

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:fe951ac027c92783d9da60970b6d9fe2841ab557280645c850b44b35f6636278
Metadata
sha256:58f11934fbc912c00f6cdc9959279a16ae8398208fc692a2e19b92ff2bde3ce2
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:179dcf4b4bc12ee9828a69b6683fda530acadf68198fb594a0806a1798cc8dea
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON