Skip to main content
OlympiadHQ

Browse · MathNet

Print

Final Round

Belarus number theory

Problem

Pairwise distinct prime numbers , , satisfy the equality
Solution
Answer: 2014. By condition, , and , , are even for all natural and , then is also even. Therefore, since and are prime, we see that either or .

If , then the initial equality has the form . But this is impossible because the right-hand side of this expression is greater than its left-hand side. Indeed, since and is prime, we have , so .

Thus and the initial equality has the form , or Since and are distinct prime numbers, we see that and are coprime. Then from (1) it follows that is divisible by , and is divisible by . Therefore and for some . We put into the former equality, then Consider this equality as a quadratic equation with respect to . Since the coefficients of (2) are integer and its root is integer, we obtain that the discriminant of (2) is necessarily a perfect square, i.e. for some nonnegative integer . Since , we see that for the discriminant is negative. Moreover, for we have . Therefore .

From (3) it follows that . Show that . If not, then from (3) it follows that It is easy to see that the latter inequality holds only for . But , so to prove that it remains to show that for and equality (2) does not hold for prime .

If , then (2) has the form and has exactly one root ; but is not prime number. If , then the discriminant of (2) is equal to ; but is not perfect square.

Therefore , i.e., taking into account that and , we have . Note that from (3) it follows that and have different parity, so can admit only two values or .

If , then from (3) we obtain or . However, it is easy to see that the discriminant of this equation is equal to , so the equation has no integer solutions.

If , then from (3) we get or . We see that and are the roots of this equation. Since , we have .

Therefore , then . From (2) we obtain . Since is integer, we have which is prime. Hence .

Thus the required value of the product is .
Final answer
2014

Techniques

Techniques: modulo, size analysis, order analysis, inequalitiesGreatest common divisors (gcd)Prime numbersQuadratic functionsLinear and quadratic inequalities