Maths Olympiad Prep

Library / /1 of 30

, 2023

Number theory Difficulty 7.1 National olympiad, round 2 Prove it Saudi Arabia

Let aa be the positive root of equation x+1x=675x + \frac{1}{x} = 675. Prove that
φ(2023(a2n+a2n))>2φ(2022(a2n+a2n)) \varphi(2023(a^{2n} + a^{-2n})) > 2 \cdot \varphi(2022(a^{2n} + a^{-2n}))
for all nZ+n \in \mathbb{Z}^+.

Solution

Notice that 2023=71722023 = 7 \cdot 17^2 and 2022=233372022 = 2 \cdot 3 \cdot 337. Put un=a2n+a2nu_n = a^{2n} + a^{-2n} then it is easy to see un+1=un22u_{n+1} = u_n^2 - 2 for every n0n \ge 0. We have u0=a+1a=675u_0 = a + \frac{1}{a} = 675 divisible by 33 so u1u_1 divided by 33 leaves 11, then u2u_2 divides 33 with remainder 1-1 and inductively un1(mod3)u_n \equiv -1 \pmod{3} with every n2n \ge 2. Similarly, unu_n is odd for all nn. Also, 6751(mod337)675 \equiv 1 \pmod{337} so u01(mod337)u_0 \equiv 1 \pmod{337} entails u11(mod337)u_1 \equiv -1 \pmod{337} and so on we also inductively un1(mod337),n1u_n \equiv -1 \pmod{337}, \forall n \ge 1. From this it follows that gcd(un,2022)=1,n1\text{gcd}(u_n, 2022) = 1, \forall n \ge 1 and so
φ(2022un)=φ(2)φ(3)φ(337)φ(un)=672φ(un). \varphi(2022u_n) = \varphi(2)\varphi(3)\varphi(337)\varphi(u_n) = 672\varphi(u_n).
Next, 6753(mod7)675 \equiv 3 \pmod 7 so u1322(mod7)u_1 \equiv 3^2 \equiv 2 \pmod 7 and inductively un2(mod7),n1u_n \equiv 2 \pmod 7, \forall n \ge 1. Finally, notice that if d=gcd(m,n)d = \text{gcd}(m, n) then
φ(mn)=φ(m)φ(n)dφ(d)φ(m)φ(n). \varphi(mn) = \varphi(m)\varphi(n) \frac{d}{\varphi(d)} \ge \varphi(m)\varphi(n).
Hence one can conclude that
φ(2023un)φ(7)φ(172)φ(un)=1632φ(un)>2672φ(un)=φ(2022un) \varphi(2023u_n) \ge \varphi(7)\varphi(17^2)\varphi(u_n) = 1632\varphi(u_n) > 2 \cdot 672\varphi(u_n) = \varphi(2022u_n)
with every nZ+n \in \mathbb{Z}^+.

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 and solution reproduced as published; topic and difficulty added by this site.