lean_workbook_plus_40980
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.
Prove that for every natural : is divisible by .
Why this node was retired
The posted statement is
theorem lean_workbook_plus_40980 : ∀ n : ℕ, 19 ∣ 5^(2*n+1) + 3^(n+2) * 2^(n-1) := by sorry
The positive-index identity is extended to natural n=0 with truncated exponent subtraction.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
For n≥1 prove19 divides5^(2n+1)+3^(n+2)2^(n−1).
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_40980 : ∀ n : ℕ, 19 ∣ 5^(2*n+1) + 3^(n+2) * 2^(n-1) := by sorry