A combinatorial proof for the Fibonacci dying rabbits problem (Q7025914)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7985937
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A combinatorial proof for the Fibonacci dying rabbits problem |
scientific article; zbMATH DE number 7985937 |
Statements
A combinatorial proof for the Fibonacci dying rabbits problem (English)
0 references
19 February 2025
0 references
The author considers the generalized Fibonacci counting problem with rabbits that become fertile at age \(f\) and die at age \(d\), with \(1 \leq f \leq d\), and \(d\) finite or infinite.\N\NIn the paper, a combinatorial proof of a recurrence relation for the number of rabbits at each generation is provided based exclusively on a counting argument and using only elementary mathematics. The author thus claims to complete previous work by this reviewer [\textit{A. M. Oller-Marcén}, Integers 9, No. 2, Article A11, 129--138 (2009; Zbl 1238.11014)]\N\NThe recurrence relation generalizes both the original Fibonacci sequence and several other Fibonacci-related sequences, such as the Padovan sequence and the Tribonacci, Tetranacci, and alike sequences.
0 references
Fibonacci counting problem
0 references
generalized Fibonacci sequences
0 references
dying rabbits problem
0 references
