New combinatorial proof of the multiple binomial coefficient identity

Keywords: Fibonacci numbers, combinatorics

Abstract


Introduction/purpose: In this paper a new combinatorial proof of an already existing multiple sum with multiple binomial coefficients is given. The derived identity is related to the Fibonacci numbers.

Methods: Combinatorial reasoning is used to obtain the results.

Results: The already known identity was obtained by using a new combinatorial reasoning.

Conclusions: The new combinatorial reasoning led to the solution of the already existing identity.

References

Benjamin, A.T. & Quinn, J.J. 2003. Proofs that Really Count: The Art of Combinatorial Proof. MAA -The Mathematical Association of America: The Dolciani Mathematical Expositions, 27. Available at: https://doi.org/10.5948/9781614442080

Flajolet, P. & Sedgewick, R. 2009. Analyitic Combinatorics. Cambridge University Press [online]. Available at: http://algo.inria.fr/flajolet/Publications/book.pdf [Accessed: 18 March 2022]. ISBN: 978-0-521-89806-5.

Gessel, I. 1972. Fibonacci is a Square. The Fibonacci Quarterly, 10(4), pp.417–419 [online]. Available at: https://www.fq.math.ca/Issues/10-4.pdf [Accessed: 18 March 2022].

Grimaldi, R.P. 2012. Fibonacci and Catalan numbers: An introduction. Hoboken, New Jersey: John Wiley and Sons, Inc. ISBN: 978-1-118-15976-7.

Singh, P. 1985. The So-called Fibonacci numbers in ancient and medieval India. Historia Mathematica, 12(3), pp.229-244. Available at: https://doi.org/10.1016/0315-0860(85)90021-7

Published
2022/06/24
Section
Original Scientific Papers