Skip to content

Erdős problem 886

Start work

Let ϵ>0\epsilon>0. Is it true that, for all large nn, the number of divisors of nn in (n1/2,n1/2+n1/2−ϵ)(n^{1/2},n^{1/2}+n^{1/2-\epsilon}) is Oϵ(1)O_\epsilon(1)?

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:3c28411a452c48f54913934d511f9cafc2ba228634ac7e79623942252aeb2e36
Metadata
sha256:125621ae2796d81aa2172b996d42076b3a45a3d1477d371b5899abec7fad61f0
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:42a224a89a34cec209245568456985f69868c94f230881e654ec08f949eb48f9
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON