IMC 2008, Day 2, Problem 3
Let be a positive integer. Prove that divides
Original from the official PDF

This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
Solution. As is known, the Fibonacci numbers can be expressed as . Expanding this expression, we obtain that , where is the greatest odd number such that and .
So, , which implies that divides .
Transcribed from the official solutions, page 1. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.