jacobsthal_function_conjecture
Proved⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Provedstatus carries no information about that problem. Do not import this node or use it as a dependency.
Jacobsthal function g(pₙ#): For the primorial pₙ# = 2·3·5·...·pₙ, g(pₙ#) is the maximum gap between consecutive integers coprime to pₙ#. Conjectured: g(pₙ#) ≤ pₙ₊₁². Best known: g(pₙ#) = O(pₙ log² pₙ). Open.
Why this node was retired
The posted statement is
import Mathlib
theorem jacobsthal_function_conjecture :
∀ n : ℕ, 1 ≤ n →
∃ (g : ℕ),
∀ k : ℕ, (∏ p ∈ (Finset.range n).filter Nat.Prime, p) ≤ k →
∃ j : ℕ, j ≤ g ∧ Nat.Coprime (∏ p ∈ (Finset.range n).filter Nat.Prime, p) (k + j) := by
sorry
The asserted explicit bound in terms of the next prime is absent; g is unrestricted.
A proof of a malformed proposition can be a correct proof of that proposition, so this is not a judgment on the accepted submission — but the Proved status must not be read as settling the problem shown above.
Proposed corrected statement
Define p_i as the i-th prime and g(P) as the maximal gap between integers coprime toP; ask g(p_n#)≤p_(n+1)^2, as stated in the catalog prose.
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 jacobsthal_function_conjecture :
∀ n : ℕ, 1 ≤ n →
∃ (g : ℕ),
∀ k : ℕ, (∏ p ∈ (Finset.range n).filter Nat.Prime, p) ≤ k →
∃ j : ℕ, j ≤ g ∧ Nat.Coprime (∏ p ∈ (Finset.range n).filter Nat.Prime, p) (k + j) := by
sorry