Maths Olympiad Prep

Library / /47 of 68

, 2017

Number theory Difficulty 5.6 AIME, harder Prove it United States

Problem:

The Fibonacci sequence is defined as follows: F0=0F_{0}=0, F1=1F_{1}=1, and Fn=Fn1+Fn2F_{n}=F_{n-1}+F_{n-2} for all integers n2n \geq 2. Find the smallest positive integer mm such that Fm0(mod127)F_{m} \equiv 0 \pmod{127} and Fm+11(mod127)F_{m+1} \equiv 1 \pmod{127}.

Solution

Solution:

First, note that 55 is not a quadratic residue modulo 127127. We are looking for the period of the Fibonacci numbers mod 127\bmod\ 127. Let p=127p=127. We work in Fp2\mathbb{F}_{p^{2}} for the remainder of this proof. Let α\alpha and β\beta be the roots of x2x1x^{2}-x-1. Then we know that Fn=αnβnαβF_{n}=\frac{\alpha^{n}-\beta^{n}}{\alpha-\beta}. Note that since xxpx \rightarrow x^{p} is an automorphism and since automorphisms cycle the roots of a polynomial we have that αp=β\alpha^{p}=\beta and βp=α\beta^{p}=\alpha. Then Fp=αpβpαβ=1F_{p}=\frac{\alpha^{p}-\beta^{p}}{\alpha-\beta}=-1 and Fp+1=αββααβ=0F_{p+1}=\frac{\alpha \beta-\beta \alpha}{\alpha-\beta}=0 and similarly we obtain F2p+1=1F_{2p+1}=1 and F2p+2=0F_{2p+2}=0. Thus since 2p+22p+2 is a power of 22 and since the period does not divide p+1p+1, we must have the answer is 2p+2=2562p+2=256.

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.