lean_workbook_plus_56266

⚠️ Retired — specification defect

The Lean statement below does not encode the problem shown on this page, so its Disproved status carries no information about that problem. Do not import this node or use it as a dependency.

Find all functions $f:\mathbb{N} \rightarrow \mathbb{N}$ such that $f(1)=5$ , $f(f(n))=4n+9$ , $f(2^n)=2^{n+1}+3$ , $\forall n \in \mathbb{N}$

Why this node was retired

The posted statement is

theorem lean_workbook_plus_56266 (f : ℕ → ℕ) (hf: f 1 = 5 ∧ ∀ n, f (f n) = 4*n + 9 ∧ f (2^n) = 2^(n+1) + 3): f = fun n => 3 + 2^n   :=  by sorry

The explicit affine witness refutes the invented exponential answer.

The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.

Proposed corrected statement

Replace the proposed function3+2^n by2n+3, subject to a complete uniqueness proof for the source classification.

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.