Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Sean S. Plott"'
Publikováno v:
Annals of Combinatorics. 12:271-278
In a recent note, Santana and Diaz-Barrero proved a number of sum identities involving the well-known Pell numbers. Their proofs relied heavily on the Binet formula for the Pell numbers. Our goal in this note is to reconsider these identities from a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa4f28352347e4419155e43fa71e1d58
https://doi.org/10.1007/s00026-008-0350-5
https://doi.org/10.1007/s00026-008-0350-5
Publikováno v:
The Electronic Journal of Combinatorics. 15
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 $G_n$ that satisfy the Fibonacci recurrence, but with arbitrar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a2dd0c0406ba895b6b179acc79ea1f7
https://doi.org/10.37236/758
https://doi.org/10.37236/758