Abstract
We provide elementary combinatorial proofs of several Fibonacci and Lucas number identities left open in the book Proofs That Really Count [1], and generalize these to Gibonacci sequences Gn that satisfy the Fibonacci recurrence, but with arbitrary real initial conditions. We offer several new identities as well. Among these, we prove Σk≥0 ( kn)G2k = 5nG2n and Σk≥0 (kn)Gqk(F q-2)n-k = (Fq)nG2n.
Cite
CITATION STYLE
APA
Benjamin, A. T., Eustis, A. K., & Plott, S. S. (2008). The 99th Fibonacci identity. Electronic Journal of Combinatorics, 15(1 R). https://doi.org/10.37236/758
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free