Maths Olympiad Prep

Track / Stage 7 / 176 of 300 #2056 of 2444

Problem 2056

National Olympiad second round; IMO P1/P4
Number theory Difficulty 7.6 Prove it Selection tests for the Gulf Mathematical Olympiad · Saudi Arabia · 2013

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

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official 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.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.