Skip to main content
OlympiadHQ

Browse · MathNet

Print

62nd Czech and Slovak Mathematical Olympiad

Czech Republic number theory

Problem

Find all pairs of integers such that
Solution
Obviously , thus we can rewrite the equation as The numerator of the fraction on the left is positive, the numerator on the right is negative just for . For we get , which has no real solution. Similarly for we get which has no real solution either. For we get , with solutions . Thus pairs and are solutions of the problem. Let us further assume , and let us find out with which numbers we can reduce the fractions in (1). If some integer divides both and , it divides as well. Similarly if divides both and , it divides . Thus there are four possibilities to fulfill the equation in (1). (i) and , which has no real solution. (ii) and ; substituting into the first equation we get , with no real solutions. (iii) and , with solution . (iv) Finally and with solutions and . Thus there are five solutions of the problem:
Final answer
[(0, 1), (-1, 1), (0, -2), (-1, -2), (7, 8)]

Techniques

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