lean_workbook_plus_82291
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 any natural number , 1)
Why this node was retired
The posted statement is
theorem lean_workbook_plus_82291 : ∀ n : ℕ, (2 : ℝ) ≤ (1 + 1 / n)^n ∧ (1 + 1 / n)^n < 3 := by sorry
Require n≥1 before asserting2≤(1+1/(n:ℝ))^n<3.
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 n≥1 before asserting2≤(1+1/(n:ℝ))^n<3.
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_82291 : ∀ n : ℕ, (2 : ℝ) ≤ (1 + 1 / n)^n ∧ (1 + 1 / n)^n < 3 := by sorry