scientific article; zbMATH DE number 2145126

From MaRDI portal
Publication:4657454





Carlitz proved the formula \[ F_L\sum_{x_1=0}^{n}\sum_{x_2=0}^{n}\cdots \sum_{x_L=0}^{n}{n-x_L\choose x_1}{n-x_1\choose x_2}\cdots {n-x_{L-1}\choose x_L}=F_{(n+1)L} \] using matrix methods and Binet's formula. In this paper the authors prove this formula using elementary combinatorial tools. They also prove other Fibonacci identities. For the entire collection see [Zbl 1054.11005].











This page was built for publication:

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