Skip to content

Erdős problem 377

Start work

Is there some absolute constant C>0C > 0 such that ∑p≤n1p∤(2nn)1p≤C \sum_{p \leq n} 1_{p\nmid {2n \choose n}}\frac{1}{p} \leq C for all nn?

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:5f2fc4dbf5ec45c4cde956c987018b6e95c9c804a0965b604986b946776b361f
Metadata
sha256:58ea724687eee4bd383b06c368e08fbeaa9565f63b96805411b7fed2824f5c94
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:a4506d23c0c617696c6be2167ee8ba91f58e32f420f661777d83887043c7b7d9
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON