Ask your own question, for FREE!
Mathematics 13 Online
OpenStudy (anonymous):

1. The Fibonacci Numbers are the numbers defined by F0 = 0, F1 = 1, and Fn = Fn−1+Fn−2 for n  2. (So for instance F2 = F1+F0 = 1+0 = 1, F3 = F2+F1 = 1+1 = 2, and F4 = F3 + F2 = 2 + 1 = 3, etc.) (a) Suppose that we set ~wn = (Fn, Fn−1) for n  1, and A =  [1 1] [1 0] . Show that the recursion relation above means that w(n+1)(subscript) = Aw(n)(subscript). (b) Use the eigenvectors of A to find a formula for A^k(w1) for any k less than or equal to 0. (c) Use the answer from (b) to find a formula for the n-th Fibonacci number Fn.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Latest Questions
Countless7Echos: Ah trying out the whole T.V girl drawing :p (I love drawing eyes)
2 hours ago 7 Replies 5 Medals
kaelynw: starting to draw a hand
1 day ago 16 Replies 2 Medals
Twaylor: Rate it :D (Took 2 days)
2 days ago 7 Replies 0 Medals
XShawtyX: Art, Short Writing Assignment: Imagining Landscapes
3 hours ago 7 Replies 1 Medal
XShawtyX: Chemistry, Help ud83dude4fud83cudffe
3 days ago 13 Replies 1 Medal
kaelynw: tried a lil smt, the arm is off but i like the other stuff
3 days ago 27 Replies 3 Medals
kaelynw: art igg
3 days ago 14 Replies 1 Medal
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!