The Fibonacci sequence is given by F 1 = 1 , F 2 = 1 , and F n + 1 = F n + F n − 1 . What is n = 3 ∑ ∞ F n − 2 F n + 2 1 ? If your answer can be expressed as b a , where a and b are coprime positive integers, find a + b .
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.
Very nicely done!
Can you explain where the first formula comes from?
Can we generalize to summing up reciprocals of F n − k F n + k ?
Log in to reply
F
n
+
2
=
F
n
+
1
+
F
n
=
2
F
n
+
F
n
−
1
F
n
−
2
=
F
n
−
F
n
−
1
I tried to generalise it, but if k is not a power of 2 then we need to consider F n − a F n + b
We can proceed by dividing and multiplying by Fn and then opening it till we get terms of Fn ,Fn+2,Fn-2 . Then we see that a term same as what we want is generated, so taking it on other side and adding makes it 3S. Now simple telescoping technique yields our answer.
Problem Loading...
Note Loading...
Set Loading...
Note that F n − 2 + F n + 2 = 3 F n ⇒ n = 3 ∑ ∞ F n − 2 F n + 2 1 = n = 3 ∑ ∞ ( F n − 2 F n + 2 1 × 3 F n F n − 2 + F n + 2 ) = 3 1 n = 3 ∑ ∞ ( F n − 2 F n 1 + F n F n + 2 1 ) = 3 1 [ F 1 F 3 1 + F 2 F 4 1 + 2 n = 3 ∑ ∞ F n F n + 2 1 ] = 1 8 5 + 3 2 [ n = 3 ∑ ∞ F n F n + 2 1 × F n + 1 F n + 2 − F n ] = 1 8 5 + 3 2 n = 3 ∑ ∞ ( F n F n + 1 1 − F n + 1 F n + 2 1 ) 1 8 5 + 3 2 × F 3 F 4 1 = 1 8 7