Browse · MathNet
PrintSelection tests for the Gulf Mathematical Olympiad 2013
Saudi Arabia 2013 number theory
Problem
Find the largest integer such that divides for all integer .
Solution
Let be a prime divisor of for all integer . Whenever is not divisible with , we have In this case, the order of modulo divides . But there exists an integer of order modulo . We deduce that divides . But the only primes such that divides are and . Conversely, all these four primes and divide for all integer by Fermat's little theorem. Notice that for , is not divisible by for all prime numbers since is relatively prime with . Therefore, the greatest integer which divides for all integer is .
Final answer
798
Techniques
Fermat / Euler / Wilson theoremsMultiplicative orderPrimitive roots mod p / p^nPrime numbers