lean_workbook_plus_61861
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.
Prove that if and are twin primes, then
Why this node was retired
The posted statement is
theorem lean_workbook_plus_61861 (p : ℕ) (hp : p.Prime) (h2 : (p + 2).Prime) : p > (1 + 2 / p) ^ 2 := by sorry
Natural division replaces2/p by0; the genuine rational inequality is stronger even though both statements are true.
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
For primes p,p+2, prove (p:ℚ)>(1+2/(p:ℚ))². Establish p≥3 and compare the genuine nonzero fraction.
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.Analysis.Complex.Basic
theorem lean_workbook_plus_61861 (p : ℕ) (hp : p.Prime) (h2 : (p + 2).Prime) : p > (1 + 2 / p) ^ 2 := by sorry