In the preceding chapter, we learned how Fibonacci numbers can be generated from Pascal's triangle. We now turn our attention to how Fibonacci and Lucas numbers can be computed from similar triangular arrays that have Pascal-like features.

In 1966, N.A. Draim of Ventura, California, and M. Bicknell of A.C. Wilcox High School, Santa Clara, California, studied the sums and differences of like-powers of the solutions of the quadratic equation c012-math-001 [149]. They were also studied in 1977 by J.E. Woko of Abia State Polytechnic, Aba, Nigeria [600]. As we will see shortly, an intriguing relationship exists between these expressions, and Fibonacci and Lucas numbers.


Let r and s be the solutions of the quadratic equation c012-math-002. Then


so c012-math-003 and c012-math-004. Consequently, and . Continuing like this, we can compute the various sums :

More generally, using PMI, Drain and ...

Get Fibonacci and Lucas Numbers with Applications, Volume 1, 2nd Edition now with the O’Reilly learning platform.

O’Reilly members experience live online training, plus books, videos, and digital content from nearly 200 publishers.