You are not logged in.
Pages: 1
Hi everyone
I have a test on Friday on geometric, artithmetic and Fibonacci sequences and I was givin a booklet which is essential to study for the test. I am stuck on the the very last question which is below and on the picture of the table.
Question: Investigate the following results and find rules in terms of Fibonacci number.
I have to fill in the table by using the rule Fn (Fn+1 + Fn-1) and
finish the rule Fn (Fn+1 + Fn-1) = ?
Thank you, I will greatly appreciate the help
Last edited by Greaterpathmagician (2009-07-29 01:53:50)
Offline
I'm having trouble upload the table. How do you upload the image?
Offline
Hi Greaterpathmagician;
f(n) = the nth fibonacci number with f(1)=1 and f(2)=1:
When n=2 the value of f(2)*(f(3)+f(1)) =3
When n=3 the value of f(3)*(f(4)+f(2)) =8
When n=4 the value of f(4)*(f(5)+f(3)) =21
When n=5 the value of f(5)*(f(6)+f(4)) =55
You can conjecture that
See if you can prove this, before you are shown.
Last edited by bobbym (2009-07-29 02:26:08)
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
Pages: 1