Maths Olympiad Prep

Library / /16 of 48

Algebra Difficulty 4.1 AIME Find the answer United States

Problem:

The Fibonacci sequence F1,F2,F3,F_{1}, F_{2}, F_{3}, \ldots is defined by F1=F2=1F_{1}=F_{2}=1 and Fn+2=Fn+1+FnF_{n+2}=F_{n+1}+F_{n}. Find the least positive integer tt such that for all n>0n>0, Fn=Fn+tF_{n}=F_{n+t}.

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

Solution

Solution:

60 .

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.