n = 1 ∑ ∞ 2 n n F n = k n = 1 ∑ ∞ 2 n F n
Let F n denote the n th Fibonacci number , where F 0 = 0 , F 1 = 1 and F n = F n − 1 + F n − 2 for n = 2 , 3 , 4 , . . . .
Find the value of k satisfying the equation above.
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.
As well there is the use of F n = 5 ( 2 1 + 5 ) n − ( 2 1 − 5 ) n directly for r value of ∑ n r n = ( 1 − r ) 2 r
Good manipulation of the generating function !
FYI I've made several edits to make your solution read easier
Log in to reply
Thank you. I'll try to improve next time.
Let a m = n = m ∑ ∞ 2 n F n . The LHS converges absolutely, and so can be rearranged into m = 1 ∑ ∞ n = m ∑ ∞ 2 n F n = m = 1 ∑ ∞ a m (to see this, note that 2 n F n appears n times, in m = 1 , 2 , … , n ), and the RHS is simply k a 1 . We will now compute a closed form expression for a m .
On one hand, a m − 1 = a m + 2 m − 1 F m − 1 or a m = a m − 1 − 2 m − 1 F m − 1 ; we simply take the term n = m − 1 out of the summation. Applying this for m ← m − 1 , we have a m − 1 = a m − 2 − 2 m − 2 F m − 2 . Summing the two together, we also get a m = a m − 2 − 2 m − 1 F m − 1 − 2 m − 2 F m − 2 .
On the other hand, using the Fibonacci recurrence relation,
a m = n = m ∑ ∞ 2 n F n = n = m ∑ ∞ 2 n F n − 1 + F n − 2 = n = m ∑ ∞ 2 n F n − 1 + n = m ∑ ∞ 2 n F n − 2 = n = m − 1 ∑ ∞ 2 n + 1 F n + n = m − 2 ∑ ∞ 2 n + 2 F n = 2 1 a m − 1 + 4 1 a m − 2
Using these relations, we can obtain the closed form:
a m a m − 2 − 2 m − 1 F m − 1 − 2 m − 2 F m − 2 a m − 2 − 2 m − 1 F m − 1 − 2 m − 2 F m − 2 4 1 a m − 2 a m − 2 a m − 2 = a m = 2 1 a m − 1 + 4 1 a m − 2 = 2 1 ( a m − 2 − 2 m − 2 F m − 2 ) + 4 1 a m − 2 = 2 m − 1 F m − 1 + 2 1 ⋅ 2 m − 2 F m − 2 = 2 m − 3 F m − 1 + 2 m − 3 F m − 2 = 2 m − 3 F m
Thus, a m = 2 m − 1 F m + 2 . Substituting this to the LHS gives
m = 1 ∑ ∞ a m = m = 1 ∑ ∞ 2 m − 1 F m + 2 = 8 m = 1 ∑ ∞ 2 m + 2 F m + 2 = 8 m = 3 ∑ ∞ 2 m F m = 8 a 3
Now we can use our closed form expression to obtain a 1 = 2 , a 3 = 4 5 . Thus the LHS is equal to 8 a 3 = 1 0 , and the RHS is equal to k a 1 = 2 k , so k = 2 1 0 = 5 .
Note that this is easily generalizable for a different base of the denominator; most 2's are simply replaced by the appropriate base.
Problem Loading...
Note Loading...
Set Loading...
Let S ( x ) = ∑ n = 1 ∞ F n × x n , and T ( x ) = ∑ n = 1 ∞ n ⋅ F n × x n . Then, we are interested in S ( 2 1 ) and T ( 2 1 ) .
According to Fibonacci series , the sum of the power series can be written as:
n = 1 ∑ ∞ F n x n = 1 − x − x 2 x .
Setting x = 2 1 , we obtain
n = 1 ∑ ∞ 2 n F n = 1 − 2 1 − ( 2 1 ) 2 2 1 = 2 .
In order to evaluate T ( x ) , we will differentiate S ( x ) : n = 1 ∑ ∞ F n × n × x n − 1 = S ′ ( x ) = d x d ( 1 − x − x 2 x ) = ( 1 − x − x 2 ) 2 1 ⋅ ( 1 − x − x 2 ) − ( − 2 x − 1 ) ( x ) = ( 1 − x − x 2 ) 2 x 2 + 1 .
Thus,
T ( x ) = n = 1 ∑ ∞ ( F n ) ( n ) x n = x ⋅ S ′ ( x ) = ( 1 − x − x 2 ) 2 x 3 + x .
Now, we can plug in x = 2 1 to obtain:
T ( 2 1 ) = ( 1 − 2 1 − ( 2 1 ) 2 ) 2 ( 2 1 ) 3 + 2 1 = 1 6 1 8 5 = 1 0
Therefore, T ( x ) = 5 ⋅ S ( x ) . As a result, k = 5 .