Skip to main content
OlympiadHQ

Browse · MathNet

Print

Estonian Mathematical Olympiad

Estonia number theory

Problem

Find all triples of primes such that .
Solution
Suppose that both and are odd. Then is even and the l.h.s. of the equation is divisible by 4. Squares of integers are congruent to 0 or 1 modulo 4 whence the r.h.s. is congruent to 1 or 2 modulo 4. The contradiction shows that one of and equals 2; let w.l.o.g. . Squares of integers are congruent to 0 or 1 modulo 3. Obviously as the l.h.s. is greater than 10. As is prime, is not divisible by 3. Thus , whence . Now implies and in turn implies . Hence is divisible by 3, i.e., . Therefore the l.h.s. is . As , we must have . But 3 is not a quadratic residue modulo 5.
Final answer
No such triples exist

Techniques

Techniques: modulo, size analysis, order analysis, inequalitiesQuadratic residues