Browse · MathNet
Print66th Belarusian Mathematical Olympiad
Belarus number theory
Problem
Prove that there are at most a finite number of primes such that the equation has a solution in positive integers and which are not divisible by .
Solution
Let denote the greatest common divisor of and , i.e., , , where . Then the given equality can be presented in the form It follows that , and, since and are coprime, and . Similarly, , so because and are coprime. Let , then the equation can be presented in the form There are exactly two possible cases:
1) .
2) .
1) If , then Therefore there are only a finite number of satisfying the problem condition.
2) By condition, (otherwise and are divisible by ), then from (1) it follows that . Since and , we have . Hence Since , from (1) and (2) it follows that is a divisor of , i.e., . Then from (3) we obtain Thus, in this case there are also only a finite number of satisfying the problem condition.
1) .
2) .
1) If , then Therefore there are only a finite number of satisfying the problem condition.
2) By condition, (otherwise and are divisible by ), then from (1) it follows that . Since and , we have . Hence Since , from (1) and (2) it follows that is a divisor of , i.e., . Then from (3) we obtain Thus, in this case there are also only a finite number of satisfying the problem condition.
Techniques
Greatest common divisors (gcd)Factorization techniquesPrime numbersTechniques: modulo, size analysis, order analysis, inequalities