Skip to content

Erdős problem 731

Let A(n)A(n) be the least positive integer not dividing (2nn)\binom{2n}{n}. Erdos asked for the behaviour of A(n)A(n) for reasonable nn. Under an explicit dyadic-regularity formalization of reasonable, the distribution is determined on dyadic intervals against the scale FX=2(log⁡2)1/4L1/4exp⁡(log⁡2)LF_X = \sqrt{2}(\log 2)^{1/4} L^{1/4} \exp\sqrt{(\log 2)L} with L=log⁡(2X)L = \log(2X).

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:63e93800cb6e28610339d45c0593c91b7692a05ca9d90667a2e40f6159fbccc0
Metadata
sha256:3c1219ad44973e2b1a412dfe70dcee62d6a8f32333208a5be0693cf3db29c2dc
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:3e5b57db74b0e23f9c61639e2e26034d8cfd1695f515d5765c608abb2e87c1d8
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb