pell_number
def
The Pell numbers are defined by P(0) = 0, P(1) = 1, and P(m+2) = P(m) + 2 P(m+1).
Statement
def pell_number : ℕ → ℕ- Defined in
- arXiv:2610.08525 Sec. 5
- Verified
- 18 Oct 2026
- Axioms
- none listed
- Used by 6
- pell_number_mono_succThe Pell numbers are nondecreasing: P(m) ≤ P(m+1).
- pell_prefix_first_letter_vectorAfter appending only the letter c_(i+1) to the prefix, the run counts are P(i+1)-P(i) at q_i, 2P(i) at q_(i+1), (P(i+1)-P(i))+2P(i) at…
- pell_number_closed_formFor every natural number m, twice the m-th Pell number equals ((1 + Real.sqrt 2) ^ m - (1 - Real.sqrt 2) ^ m) / Real.sqrt 2.
- pell_number_two_mul_sub_add2(P(m+1) - P(m)) + 2 P(m) = 2 P(m+1).
- pell_family_asymptotic_baseThe sequence (2 * pell_number (n - 2))^(1/n) converges to 1 + Real.sqrt 2 as n tends to infinity.
- pell_number_sub_add_leftP(m+1) - P(m) + 2 P(m) = P(m+2) - P(m+1).
Read back from the Lean
The function pell_number : ℕ → ℕ, defined recursively by pell_number 0 = 0, pell_number 1 = 1, and pell_number (m + 2) = pell_number m + 2 * pell_number (m + 1) for all natural numbers m.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The Pell numbers P_m defined by P_0 = 0, P_1 = 1, and P_{m+2} = P_m + 2 P_{m+1}. -/ def pell_number : ℕ → ℕ | 0 => 0 | 1 => 1 | m + 2 => pell_number m + 2 * pell_number (m + 1)