scientific article; zbMATH DE number 3346430

From MaRDI portal
Publication:5622255





Some elementary but elegant mathematics solves the problem of finding the sums of integers appearing on diagonals of Pascal's Triangle. It is well-known that one such sequence of sums is the Fibonacci sequence \(1,1,2,3,5, \ldots \), and another the powers of \(2\). To state the problem more explicitly, when Pascal's Triangle is written in a left-justified manner, find the infinite sequence of sums of binomial coefficients appearing on diagonals \(p/q\) for integers \(p\) and \(q\), \(p+q \ge 1\), \(q>0\), where entries on diagonal \(p/q\) are found by counting up \(p\) and right \(q\), starting in the left-most column. The solution is given in terms of a generating function \[ S=\frac{(1-x)^{q-1}}{(1-x)^{q}-x^{p+q}}, \quad p+q \geq 1, q>0 \] which converges for \(|x|\) less than the absolute value of the root of smallest absolute value of \(x^{p+q}-(1-x)^{q}=0\), and which gives the sums of binomial coefficients found along the diagonals \(p/q\) as coefficients of successive powers of \(x\). Original work on this topic was reported by \textit{V. C. Harris} and \textit{C. C. Styles} [Fibonacci Q. 2, No. 4, 277--289 (1964; Zbl 0125.29406)]. For Part VII, see ibid. 8, No. 4, 407--420 (1970) giving an introduction to Fibonacci polynomials and their divisibility properties.












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 Q5622255)