infinite_primes_quadratic_ap
Disproved⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Disprovedstatus carries no information about that problem. Do not import this node or use it as a dependency.
Primes represented by quadratic polynomials: Does every primitive quadratic form represent infinitely many primes? Proved for linear polynomials (Dirichlet). For irreducible quadratics like n²+1, this is the Bunyakovsky conjecture (open).
Why this node was retired
The posted statement is
import Mathlib
theorem infinite_primes_quadratic_ap :
∀ (a b c : ℤ) (_ : 0 < a) (_ : Nat.Coprime a.natAbs (Nat.gcd b.natAbs c.natAbs)),
∃ n : ℤ, Nat.Prime (a * n ^ 2 + b * n + c).natAbs := by
sorry
Primitivity of coefficients does not imply irreducibility or absence of a fixed prime divisor; only one prime value is requested despite the title.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
Require irreducibility and no fixed prime divisor, positive leading coefficient, and ask for infinitely many natural inputs with positive prime values, matching the intended Bunyakovsky theme.
Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.
import Mathlib
import Mathlib
theorem infinite_primes_quadratic_ap :
∀ (a b c : ℤ) (_ : 0 < a) (_ : Nat.Coprime a.natAbs (Nat.gcd b.natAbs c.natAbs)),
∃ n : ℤ, Nat.Prime (a * n ^ 2 + b * n + c).natAbs := by
sorry