Browse · MathNet
PrintSaudi Arabia Mathematical Competitions
Saudi Arabia number theory
Problem
Let be a prime. For , let be the remainder when the integer is divided by . Prove that
Solution
For , we have for some integer . It follows hence We obtain Because we obtain that and we get for all , Adding up all these relations it follows hence
Techniques
Fermat / Euler / Wilson theoremsFactorization techniquesAlgebraic properties of binomial coefficients