1 0 0 1 + 1 0 1 1 + 1 0 2 2 + 1 0 3 3 + 1 0 4 5 + 1 0 5 8 + 1 0 6 1 3 + ⋯
If the value of the sum above can be expressed as n m for positive coprime integers m and n , find m 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.
I somehow deleted my solution and now I can't post it again, so I'll just write it here:
Let the sum be S:
S = 1 + 1 0 1 + 1 0 2 2 + 1 0 3 3 + 1 0 4 5 + 1 0 5 8 + . . .
1 0 1 S = 1 0 1 + 1 0 2 1 + 1 0 3 2 + 1 0 4 3 + 1 0 5 5 + . . .
⇒ 1 0 9 S = 1 + 1 0 1 − 1 0 1 + 1 0 2 2 − 1 0 2 1 + 1 0 3 3 − 1 0 3 2 + 1 0 4 5 − 1 0 4 3 + 1 0 5 8 − 1 0 5 5 + . . . = 1 + 1 0 2 1 + 1 0 3 1 + 1 0 4 2 + 1 0 5 3 + 1 0 6 5 + . . .
At this moment note that 1 0 2 1 + 1 0 3 1 + 1 0 4 2 + 1 0 5 3 + 1 0 6 5 + . . . = 1 0 2 S .
⇒ 1 0 9 S = 1 + 1 0 2 S ⇒ 1 0 0 8 9 S = 1 ⇒ S = 8 9 1 0 0 ⇒ m = 1 0 0 , n = 8 9
Now, m n + 1 = 1 0 9 0 = 9 .
Using Binet's Formula
F n = 5 ( 2 1 + 5 ) n − ( 2 1 − 5 ) n
The required sum is
S = n = 0 ∑ ∞ 1 0 n − 1 F n = 5 1 n = 0 ∑ ∞ 1 0 n − 1 1 ⋅ [ ( 2 1 + 5 ) n − ( 2 1 − 5 ) n ] = 5 1 0 n = 0 ∑ ∞ ( 2 0 1 + 5 ) n − ( 2 0 1 − 5 ) n = 5 1 0 ( 1 − 2 0 1 + 5 1 + 1 − 2 0 1 − 5 1 ) = 8 9 1 0 0
Making the answer
1 0 0 8 9 + 1 = 9
let
F 0 = 1
F 1 = 1
F n = F n − 1 + F n − 2
P ( x ) = F 0 + F 1 x + F 2 x 2 + . . . .
Then we have
( 1 − x − x 2 ) P ( x ) = F 0 + ( F 1 − F 0 ) x + ( F 2 − F 1 − F 0 ) x 2 + ( F 3 − F 2 − F 1 ) x 3 + . . .
Every term except the constant is zero so we are left with
( 1 − x − x 2 ) P ( x ) = F 0 = 1
P ( x ) = 1 − x − x 2 1
Our desired value is simply
P ( 1 / 1 0 ) = 1 0 0 / 8 9
Thus
m = 1 0 0 n = 8 9
Giving our solution as
1 0 0 n + 1 = 1 0 9 0 = 9
Nice use of the Fibonacci generating function!
how did you get the 5th equation?
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Fibonacci Sequence
S = 1 0 0 1 + 1 0 1 1 + 1 0 2 2 + 1 0 3 3 + 1 0 4 5 + 1 0 5 8 + 1 0 6 1 3 + ⋯ = n = 1 ∑ ∞ 1 0 n − 1 F n = 1 0 n = 0 ∑ ∞ 1 0 n F n = 1 0 ( F 0 + 1 0 F 1 + n = 2 ∑ ∞ 1 0 n F n ) = 1 0 ( 1 0 1 + n = 2 ∑ ∞ 1 0 n F n − 1 + F n − 2 ) = 1 0 ( 1 0 1 + n = 2 ∑ ∞ 1 0 n F n − 1 + n = 2 ∑ ∞ 1 0 n F n − 2 ) = 1 0 ( 1 0 1 + 1 0 1 n = 0 ∑ ∞ 1 0 n F n + 1 0 0 1 n = 0 ∑ ∞ 1 0 n F n ) = 1 + 1 0 1 S + 1 0 0 1 S F n is the n th Fibonacci number.
⟹ 1 0 0 8 9 S S ⟹ m n + 1 = 1 = 8 9 1 0 0 = 1 0 0 8 9 + 1 = 9