lean_workbook_plus_36439
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 positive integer is the multiple of 11.
Why this node was retired
The posted statement is
theorem lean_workbook_plus_36439 : ∀ n : ℕ, 11 ∣ (2^(6*n - 5) + 3^(2*n)) := by sorry
The source positive-index assumption was dropped.
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 prove11 divides2^(6n−5)+3^(2n), with natural exponent subtraction justified by 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_36439 : ∀ n : ℕ, 11 ∣ (2^(6*n - 5) + 3^(2*n)) := by sorry