A combinatorial proof for the Fibonacci dying rabbits problem

MaRDI QIDQ7025914zbMATH OpenFDO

Authors Roberto De Prisco

Publication date 19 February 2025

Published in Bulletin of the Institute of Combinatorics and its Applications (Search for Journal in Brave)

Full work available at URL https://luca-giuzzi.unibs.it/ICA/Volumes/103/Reprints/BICA2024-01-Reprint.pdf

zbMATH Keywords

dying rabbits problem Fibonacci counting problem generalized Fibonacci sequences

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Special sequences (11K31)

Review text

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.

This page was built for publication: A combinatorial proof for the Fibonacci dying rabbits problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025914)