Let f(x)=x2−2, and let fn denote the function f applied n times. Compute the remainder when f24(18) is divided by 89.
A number or a short expression. Spacing and $ signs are ignored.
Solution
Let Ln denote the Lucas numbers given by L0=2,L1=1, and Ln+2=Ln+1+Ln. Note that Ln2−2=L2n when n is even (one can show this by induction, or explicitly using Ln=(21+5)n+(21−5)n).So, f24(L6)=L3⋅225. Now note that since 89≡4(mod5), we have 52p−1≡1(mod89) so L89=(21+5)p+(21−5)p≡L1(mod89) and similarly L90≡L2, so the sequence Ln(mod89) is periodic with period 88. (Alternatively, reason by analog of Fermat's little theorem, since we can substitute an integer residue for 5.) We have 3⋅225≡3⋅25≡8(mod11) and ≡0(mod8), so L3⋅225≡L8(mod89). Computing L8=47 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: Omni-MATH,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.