Browse · MathNet
Print19th Turkish Mathematical Olympiad
Turkey algebra
Problem
Let for all and . Prove that if is a prime divisor of , then .
Solution
Observe that for all . By induction on we obtain for all . Therefore .
Let be a prime divisor of . It is well known that if is a prime divisor of , then or . Thus . That is .
Let be a prime divisor of . It is well known that if is a prime divisor of , then or . Thus . That is .
Techniques
Recurrence relationsQuadratic residues