Documentation

Sequencelib.Fibonacci

Fibonacci numbers #

This file introduces the Fibonacci sequence.

Implementations notes #

We use the definition from Mathlib.

Main results #

References #

OEIS Identifier

Equations
Instances For

    OEIS sequence offset

    Equations
    Instances For
      Equations
      • One or more equations did not get rendered due to their size.
      Instances For

        OEIS sequence offset

        Equations
        Instances For

          OEIS Identifier

          Equations
          Instances For
            theorem Sequence.sum_range_fib_eq_fib (n : ℕ) :
            ∑ i ∈ Finset.range (n + 1), Fibonacci (i + 1) = Fibonacci (n + 3) - 1

            F_0 + F_1 + ... + F_n = F_{n+3} - 1.

            This is Identity 1 (page 2) from Proofs that Really Count: The Art of Combinatorial Proof by Arthur T. Benjamin and Jennifer J. Quinn.

            theorem Sequence.two_mul_fib_n (n : ℕ) (hn : 2 ≤ n) :
            2 * Fibonacci n = Fibonacci (n + 1) + Fibonacci (n - 2)

            2 F_n = F_{n+1} + F_{n-2}.

            This Identity 16 (page 13) from Proofs that Really Count: The Art of Combinatorial Proof by Arthur T. Benjamin and Jennifer J. Quinn.

            theorem Sequence.three_mul_fib_n (n : ℕ) (hn : 2 ≤ n) :
            3 * Fibonacci n = Fibonacci (n + 2) + Fibonacci (n - 2)

            3 F_n = F_{n+2} + F_{n-2}.

            This is Identity 7 (page 6) from Proofs that Really Count: The Art of Combinatorial Proof by Arthur T. Benjamin and Jennifer J. Quinn.

            theorem Sequence.four_mul_fib_n (n : ℕ) (hn : 2 ≤ n) :

            4 F_n = F_{n+2} + F_n + F_{n-2}.

            This is Identity 18 (page 13) from Proofs that Really Count: The Art of Combinatorial Proof by Arthur T. Benjamin and Jennifer J. Quinn.