If Only It Was (n-2)(n+2)

The Fibonacci sequence is given by F 1 = 1 F_1 = 1 , F 2 = 1 F_2 = 1 , and F n + 1 = F n + F n 1 F_{n+1} = F_n + F_{n-1} . What is n = 3 1 F n 2 F n + 2 ? \sum_{n=3}^\infty \frac{ 1 } { F_{n-2} F_{n+2} } ? If your answer can be expressed as a b \frac{a}{b} , where a a and b b are coprime positive integers, find a + b a+b .


Inspiration .


The answer is 25.

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.

2 solutions

Shaun Leong
Dec 16, 2016

Note that F n 2 + F n + 2 = 3 F n F_{n-2}+F_{n+2}=3F_n n = 3 1 F n 2 F n + 2 \Rightarrow \sum_{n=3}^\infty \dfrac{1}{F_{n-2}F_{n+2}} = n = 3 ( 1 F n 2 F n + 2 × F n 2 + F n + 2 3 F n ) =\sum_{n=3}^\infty \left(\dfrac{1}{F_{n-2}F_{n+2}} \times \dfrac{F_{n-2}+F_{n+2}}{3F_n}\right) = 1 3 n = 3 ( 1 F n 2 F n + 1 F n F n + 2 ) =\dfrac13 \sum_{n=3}^\infty \left(\dfrac{1}{F_{n-2}F_n}+\dfrac{1}{F_n F_{n+2}}\right) = 1 3 [ 1 F 1 F 3 + 1 F 2 F 4 + 2 n = 3 1 F n F n + 2 ] =\dfrac13 \left[\dfrac{1}{F_1 F_3}+\dfrac{1}{F_2 F_4}+2\sum_{n=3}^\infty \dfrac{1}{F_n F_{n+2}}\right] = 5 18 + 2 3 [ n = 3 1 F n F n + 2 × F n + 2 F n F n + 1 ] =\dfrac{5}{18}+\dfrac23 \left [\sum_{n=3}^\infty \dfrac{1}{F_n F_{n+2}} \times \dfrac{F_{n+2}-F_n}{F_{n+1}}\right] = 5 18 + 2 3 n = 3 ( 1 F n F n + 1 1 F n + 1 F n + 2 ) =\dfrac{5}{18}+\dfrac23 \sum_{n=3}^\infty \left(\dfrac{1}{F_n F_{n+1}}-\dfrac{1}{F_{n+1} F_{n+2}}\right) 5 18 + 2 3 × 1 F 3 F 4 \dfrac{5}{18}+\dfrac23 \times \dfrac{1}{F_3 F_4} = 7 18 =\boxed{\dfrac{7}{18}}

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 F_{n-k} F_{n+k} ?

Calvin Lin Staff - 4 years, 5 months ago

Log in to reply

F n + 2 = F n + 1 + F n = 2 F n + F n 1 F_{n+2}=F_{n+1}+F_n=2F_n+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 F_{n-a}F_{n+b}

Shaun Leong - 4 years, 5 months ago
Umang Garg
Dec 27, 2016

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.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...