Maths Olympiad Prep

Library / HMMT November /434 of 672

HMMT November

Algebra Difficulty 5.1 AIME, harder Find the answer

Let f(x)=x2−2f(x)=x^{2}-2, and let fnf^{n} denote the function ff applied nn times. Compute the remainder when f24(18)f^{24}(18) is divided by 89.

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

Solution

Let LnL_{n} denote the Lucas numbers given by L0=2,L1=1L_{0}=2, L_{1}=1, and Ln+2=Ln+1+LnL_{n+2}=L_{n+1}+L_{n}. Note that Ln2−2=L2nL_{n}^{2}-2=L_{2 n} when nn is even (one can show this by induction, or explicitly using Ln=L_{n}= (1+52)n+(1−52)n)\left.\left(\frac{1+\sqrt{5}}{2}\right)^{n}+\left(\frac{1-\sqrt{5}}{2}\right)^{n}\right).So, f24(L6)=L3⋅225f^{24}\left(L_{6}\right)=L_{3 \cdot 2^{25}}. Now note that since 89≡4( mod 5)89 \equiv 4(\bmod 5), we have 5p−12≡1( mod 89)5^{\frac{p-1}{2}} \equiv 1(\bmod 89) so L89=(1+52)p+(1−52)p≡L1L_{89}=\left(\frac{1+\sqrt{5}}{2}\right)^{p}+\left(\frac{1-\sqrt{5}}{2}\right)^{p} \equiv L_{1} ( mod 89)(\bmod 89) and similarly L90≡L2L_{90} \equiv L_{2}, so the sequence Ln( mod 89)L_{n}(\bmod 89) is periodic with period 88. (Alternatively, reason by analog of Fermat's little theorem, since we can substitute an integer residue for 5\sqrt{5}.) We have 3⋅225≡3⋅25≡8( mod 11)3 \cdot 2^{25} \equiv 3 \cdot 2^{5} \equiv 8(\bmod 11) and ≡0( mod 8)\equiv 0(\bmod 8), so L3⋅225≡L8( mod 89)L_{3 \cdot 2^{25}} \equiv L_{8}(\bmod 89). Computing L8=47L_{8}=47 gives the answer.

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

Source: Omni-MATH, licensed Apache-2.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.