Consider the recurrence relation with initial values F ( 0 ) = 0 , F ( 1 ) = 2 3 and F ( n ) = 2 5 F ( n − 1 ) − F ( n − 2 ) .
To 2 decimal places, evaluate n = 0 ∑ ∞ F ( 2 n ) 1 .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Simple standard approach. I'm surprised that this problem was so easy.
Are you sure ? What is F (2)=¿
Log in to reply
Oh I didn't spot my error. Thanks for notifying me.
I saw plus instead of minus for the longest time and got stuff wrong with semi legit math (with plus it multiplies 29/4 every increment of 2 i found out) So i wrote code instead (y) Then i found my mistake But the code was already there with the switch of a sign so i stuck with it: http://goo.gl/Q3QeKb
Problem Loading...
Note Loading...
Set Loading...
By induction, we can see that F ( n ) = 2 n − 1 / 2 n .
Let x n = 2 2 n ⇒ x n + 1 = x n 2 .
F ( 2 n ) 1 = x n 2 − 1 x n = x n 2 − 1 x n + 1 − x n 2 − 1 1 = x n − 1 1 − x n + 1 − 1 1
Sum telescope to x 0 − 1 1 = 1 .