Browse · MathNet
PrintSaudi Arabian IMO Booklet
Saudi Arabia number theory
Problem
Let be a prime number and let , be integers greater than such that . Prove that .
Solution
Set and write . Let be an arbitrary prime divisor of , and set . Since it follows that . If , then clearly , and therefore is a common divisor of and . Otherwise, suppose that for all prime divisors of . Together with by Fermat's Little Theorem, we have Thus, any prime divisor of satisfies . Because is a product of these prime divisors, we deduce that . However, this contradicts to .
Techniques
Multiplicative orderFermat / Euler / Wilson theoremsGreatest common divisors (gcd)