Maths Olympiad Prep

Library / /2 of 11

, 2013

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

Find the largest integer kk such that kk divides n55nn^{55} - n for all integer nn.

Solution

Let pp be a prime divisor of n55nn^{55} - n for all integer nn. Whenever nn is not divisible with pp, we have
n541modp n^{54} \equiv 1 \quad \bmod p
In this case, the order of nn modulo pp divides 5454. But there exists an integer nn of order p1p-1 modulo pp. We deduce that p1p-1 divides 5454. But the only primes pp such that p1p-1 divides 5454 are p=2,3,7p=2,3,7 and 1919. Conversely, all these four primes 2,3,72,3,7 and 1919 divide n55nn^{55} - n for all integer nn by Fermat's little theorem.
Notice that for pp, p551p^{55} - 1 is not divisible by p2p^2 for all prime numbers pp since p541p^{54} - 1 is relatively prime with pp. Therefore, the greatest integer kk which divides n55nn^{55} - n for all integer nn is 2×3×7×19=7982 \times 3 \times 7 \times 19 = 798.

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.