Baltic Way 2011 · Shortlist problem
C·Combinatorics
Compute the sum
n=1∑∞10n+1Fn
where Fn is the nth Fibonacci number given by F1=F2=1 and Fn+1=Fn+Fn−1 for all n≥2.
Review material becomes available with the next Daily.
Review
Topics
Counting and enumeration
Solutions
Solution
Let
X=n=1∑∞10n+1Fn
Then
X=1021+1031+1042+1053+1065+1078+10813+…
So
10X=101+1021+1032+1043+1055+1068+10713+…
and
100X=1+101+1022+1033+1045+1058+10613+…
Then 100X−10X−X=1 (using the basic property of the Fibonacci numbers).
So X=891