Back to Problems

erdos_376.variants.prime

Specification

Erdős, Graham, Ruzsa, and Straus [EGRS75] have shown that, for any two odd primes $p$ and $q$, there are infinite many $n$ such that ${2n\choose n}$ is coprime to $pq$.

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement 
theorem erdos_376.variants.prime {p q : ℕ} (h₁ : p.Prime)
    (h₂ : Odd p) (h₃ : q.Prime) (h₄ : Odd q) :
    { (n : ℕ) | n.centralBinom.Coprime (p * q) }.Infinite
ID: ErdosProblems__376__erdos_376.variants.prime
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.