Skip to main content
OlympiadHQ

Browse · MathNet

Print

Junior Macedonian Mathematical Olympiad

North Macedonia number theory

Problem

Find all numbers , and , such that and are prime, is a positive integer so that they satisfy the equation:
Solution
After simplifying the equation we get . Since is prime, it follows that is a divisor of , so that is a divisor of the right-hand side of the last equality. This implies that is a divisor of . If , then is a divisor of , so that has to be a divisor of both and , but since is prime, that is possible only if and . After simplification we get , from where . The last equality has no integer solutions, so in this case the equation has no solution.

If , then and have the same parity, the case when is impossible together with the previous case , so they have to be odd. Let be a prime divisor of , then must be a divisor of too, so that it must be a divisor of and , which is possible only if and , in this case we get , from where , with solutions . If the number is an integer, then it is odd, so , from where , from where it cannot be prime.

Therefore and must be powers of 2, i.e. and , from where and , and since and are odd, , but then , which is impossible. It follows that the equation has no prime number solutions.
Final answer
No solutions; there are no primes p and r and positive integer q that satisfy the equation.

Techniques

Prime numbersGreatest common divisors (gcd)Techniques: modulo, size analysis, order analysis, inequalities