Theorems · Definition · number theory
Int.fib
ℤ → ℤ
The Fibonacci sequence for integers. This satisfies fib 0 = 0, fib 1 = 1,
fib (n + 2) = fib n + fib (n + 1).
This is an extension of Nat.fib.
- Defined in
- Mathlib.Data.Int.Fib.Basic
- Cited by
- 26 results in Mathlib
- Foundations
- Depth 69 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by26
Results whose statement or proof uses this declaration.
- Int.fib_negstatement and proof · cited by 4
- Int.fib_neg_natCaststatement · cited by 4
- Int.fib_addstatement · cited by 3
- Int.fib_add_twostatement and proof · cited by 2
- Int.fib_of_oddstatement · cited by 2
- Int.fib_natCaststatement · cited by 1
- Int.fib_two_mulstatement and proof · cited by 1
- Int.fib_two_mul_add_twostatement and proof · cited by 0
- Int.fib_zerostatement · cited by 0
- Int.gcd_fibstatement and proof · cited by 0
- Real.coe_intFib_eqstatement and proof · cited by 0
- Int.coe_fib_negstatement and proof · cited by 0