1

Fibonacci matrices
1. The Fibonacci sequence of numbers starts with 1, 1, 2, and each number (after the rst two) is the sum of the two before it. Notice that 2 is 1 + 1. The next number would be 3, because 1 + 2 = 3. Then the next would be 5, because 2 + 3 = 5. Find the next four numbers in the sequence: 1, 1, 2, 3, 5, , , , What is the tenth number in the Fibonacci sequence? What is the twentieth number in the sequence? (You can use a calculator to help, if you like.) Would you want to try to nd the ftieth number? Can you think of a good way to nd any number in the sequence? Can you do it without nding all the previous numbers in the sequence? Dene the matrix A as follows: A= 0 1 1 1
You can use any type of toolincluding calculators and spreadsheetsthat you like.

2. 3.

4.

5.

The rst two numbers in the Fibonacci sequence are 1, 1. Write them as a 2 1 matrix, B : 1 1

B=

(a) Find the product AB . (b) Multiply the result by A on the leftthat is, nd A(AB ), which is A2 B . (c) Now nd A3 B . (d) Put the results together to form a sequence of matrices, B, AB, A2 B, A3 B, . . . . Describe the entries of An B , as specically as you can. (e) Explain why the entries of An B are Fibonacci numbers. 6. Use the matrix sequence and a graphing calculator (or computer algebra system) to nd the ftieth number in the Fibonacci sequence.

Hint: What happens when you multiply by A on the left? a A =? b

Problems with a Point: February 20, 2002

c EDC 2002

Fibonacci matrices: Answers

Answers
1. 2. 3. The next four numbers are 8, 13, 21, and 34. 55 The twentieth number is 6765. Depending on the method, it could be tedious to nd the ftieth number. See the next answer. Depending on the tool used, there are ways to nd the numbers that are simpler than entering Fn + Fn+1 every time. For example, using some graphing calculators (such as the TI-86 or TI-92), you can enter the rst two numbers (1 and 1) and then use the last answer function: ans(1) + ans(2) would give the sum of the last two answers. Then repeated pressing of the ENTER button will give subsequent Fibonacci numbers. Using a spreadsheet, you can put 1 into cells A1 and A2, dene A3 to be the sum A1 + A2, then ll down as far as you like. The spreadsheet adjusts the formula as it lls the cells so that each cells value is the sum of the two values above it. A student who is adept with any programming language (including a graphing calculators language) could write a simple program to nd any Fibonacci number using a single loop. For example, a TI-83 program might look like this: PROGRAM:FIBONACC :Input "WHICH FIBONACCI NUMBER?",F :1B :1C :For(I,3,F) :BA :CB :A+BC :End :Disp C These will give accurate answers fairly quickly, but in each case, every number must be calculated. 1 2
The nth Fibonacci number is often noted Fn .

4.

5. (a) AB =

Problems with a Point: February 20, 2002

c EDC 2002

Fibonacci matrices: Answers

2 3 3 (c) A3 B = 5 (d) The entries are numbers in the Fibonacci sequence the top entry is term n + 1 (that is, Fn+1 ) and the bottom entry is term n + 2 (that is, Fn+2 ). (e) When you multiply, the top row of matrix A just moves the bottom entry of the multiplied matrix to the top entry for the result. The bottom entry in the result is just the sum of the two entries in the multiplied matrixso each time youre just adding the two preceding numbers. (b) A2 B = 6. 12586269025 (This is the bottom entry in A48 B or the top entry in A49 B .)
To use the matrix capabilities of a graphing calculator, rst dene (edit) the matrices. You will have to dene the dimensions before you can assign values to the entries. When the matrices are both dened, you can access the matrix list to use them as if they were numbers. Consult your manual if necessary.

Problems with a Point: February 20, 2002

c EDC 2002