Maths Olympiad Prep

Library / /52 of 377

Algebra Difficulty 4.5 AIME Find the answer United States

Problem:

Let FnF_{n} be the Fibonacci sequence, that is, F0=0F_{0}=0, F1=1F_{1}=1, and Fn+2=Fn+1+FnF_{n+2}=F_{n+1}+F_{n}. Compute n=0Fn/10n\sum_{n=0}^{\infty} F_{n} / 10^{n}.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Solution:

Write F(x)=n=0FnxnF(x)=\sum_{n=0}^{\infty} F_{n} x^{n}. Then the Fibonacci recursion tells us that F(x)xF(x)x2F(x)=xF(x)-x F(x)-x^{2} F(x)=x, so F(x)=x/(1xx2)F(x)=x /\left(1-x-x^{2}\right). Plugging in x=1/10x=1 / 10 gives the answer.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.