Back to Problems

erdos_377.variants.ub

Specification

Erdos, Graham, Ruzsa, and Straus proved that if $$ f(n) = \sum_{p \leq n} 1_{p\nmid {2n \choose n}}\frac{1}{p} $$ then there is some constant $c < 1$ such that for all large $n$ $$ f(n) \leq c \log\log n. $$ [EGRS75] Erdős, P. and Graham, R. L. and Ruzsa, I. Z. and Straus, E. G., _On the prime factors of $\binom{2n}{n}$_. Math. Comp. (1975), 83-92.

Actions

Submit a Proof

Have a proof attempt? Submit it for zero-trust verification.

Submit Proof
Lean 4 Statement
theorem erdos_377.variants.ub : ∃ c < (1 : ℝ),
      ∀ᶠ n in atTop, sumInvPrimesNotDvdCentralBinom n ≤ c * (n : ℝ).log.log
ID: ErdosProblems__377__erdos_377.variants.ub
Browse 300 unsolved math conjectures formalized in Lean 4
Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →
ASI Prize documentation for formal verification pipeline
Docs

Verification Pipeline

How zero-trust verification works.

Read docs →
Evaluation Results

Recent Submissions

No submissions yet. Be the first to attempt this problem.