Source labels openChecked July 26, 2026

Erdős Problem 377

Is there some absolute constant $C > 0$ such that $\sum_{p \leq n} 1_{p\nmid {2n \choose n}}\frac{1}{p} \leq C$ for all $n$ ?

Number theory AMS 11

Mathematical statement

Is there some absolute constant $C > 0$ such that

\sum_{p \leq n} 1_{p\nmid {2n \choose n}}\frac{1}{p} \leq C

for all $n$ ?

Statement source: Erdős Problems statement material

Statement terms: Source-specific

Source-specific terms. Therefore does not assert reuse rights beyond attributed display.

Statement artifacts, not proofs

These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.

Pinned Lean formulation 1

erdos_377

Canonical source

Complete statement target, proof intentionally absentLean 4

theorem erdos_377 : answer(sorry) ↔    ∃ C > (0 : ℝ), ∀ (n : ℕ), sumInvPrimesNotDvdCentralBinom n ≤ C := by  sorry

Statement source: Formal Conjectures
Lean version: v4.27.0
Placeholder: Present; no proof artifact
Source evidence: Pinned source index
Fidelity review: Community formulation

References

Pinned Formal Conjectures sourceformalization erdosproblems.com/377background