Mathematics, 14.07.2020 20:01 CurlyheadShay
The sequence of numbers 1, 1, 3, 5, 11, 21, 43, 85, 171, 341, … is like the original Fibonacci sequence except that it is defined recursively by f1 = 1, f = 1, and fn+1 = fn + 2 for n >=2.
The latter equation can be put into matrix form as
fn+1 1 2 fn
fn = 1 0 fn-1
By using the techniques (and showing the steps) that we did in class for the original Fibonacci sequence, find an explicit formula for f, in the sequence defined above. With that formula, use your calculator to find f22 and f50.
Answers: 1
Mathematics, 21.06.2019 20:30
Can someone me with #s 8, 9, and 11. with just one of the three also works. prove using only trig identities.
Answers: 3
Mathematics, 21.06.2019 23:30
Dawn is selling her mp3 player for 3 4 of the original price. the original price for the mp3 player was $40. how much is she selling her mp3 player for?
Answers: 1
The sequence of numbers 1, 1, 3, 5, 11, 21, 43, 85, 171, 341, … is like the original Fibonacci seque...
Social Studies, 08.10.2019 23:30
English, 08.10.2019 23:30