0 . 1 + 0 . 0 1 + 0 . 0 0 2 + 0 . 0 0 0 3 + 0 . 0 0 0 0 5 + 0 . 0 0 0 0 0 8 + …
The series above shows the sum of all n th Fibonacci number, shifted n places to the right (that is, divided by 1 0 n ). If its closed form can be represented as b a for 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.
The generating function for the Fibonacci numbers is
1 − x − x 2 x = k = 1 ∑ ∞ F k x k
Plug in x = 1 0 1 and you're done.
Further generalise your proof? JkJk.
The relation is valid only for the range x ∈ ( 2 − 1 − 5 , 2 − 1 + 5 )
Oh dear I hated this one but I'm so glad I finished it. First define the n t h term as f ( n ) .
Seeing as this is the sum of Fibonacci numbers, it first makes sense to consider each term as the sum of the previous 2. i.e. 1 0 0 f ( n − 2 ) + 1 0 f ( n − 1 ) = f ( n ) ⟹ 1 0 0 f ( n ) = 1 0 f ( n − 1 ) + f ( n − 2 )
Let x = ∑ n = 1 ∞ f ( n ) . Now the fun begins by multiplying by 100 1 0 0 x = 1 0 0 n = 1 ∑ ∞ f ( n ) = n = 1 ∑ ∞ 1 0 0 f ( n ) 1 0 0 x = 1 1 + n = 3 ∑ ∞ 1 0 0 f ( n ) 1 0 0 x = 1 1 + n = 3 ∑ ∞ f ( n − 2 ) + n = 3 ∑ ∞ 1 0 f ( n − 1 ) 1 0 0 x = 1 1 + n = 1 ∑ ∞ f ( n ) + n = 2 ∑ ∞ 1 0 f ( n ) 1 0 0 x = 1 1 + n = 1 ∑ ∞ f ( n ) + n = 1 ∑ ∞ 1 0 f ( n ) − 1 1 0 0 x = 1 1 + x + 1 0 x − 1 8 9 x = 1 0 x = 8 9 1 0
Now that we know what x is, we can now say a + b = 1 0 + 8 9 = 9 9
Problem Loading...
Note Loading...
Set Loading...
Let
S = 1 0 F 1 + 1 0 0 F 2 + 1 0 0 0 F 3 + ⋯ = n = 1 ∑ ∞ 1 0 n F n
where F n denotes the n -th Fibonacci number.
1 0 S 1 0 S − S 9 S 9 S S = F 1 + 1 0 F 2 + 1 0 0 F 3 + ⋯ = F 1 + ( 1 0 F 2 − 1 0 F 1 ) + ( 1 0 0 F 3 − 1 0 0 F 2 ) + ⋯ = 1 + 0 + 1 0 0 F 1 + 1 0 0 0 F 2 + ⋯ = 1 + 1 0 S = 8 9 1 0 .
Thus, a + b = 1 0 + 8 9 = 9 9 .