Browse · MathNet
PrintTHE 68th NMO SELECTION TESTS FOR THE BALKAN AND INTERNATIONAL MATHEMATICAL OLYMPIADS
Romania number theory
Problem
a) Determine all 4-tuples of pairwise distinct integers such that each is coprime to (indices are reduced modulo 4), and the cyclic sum is an integer.
b) Show that there are infinitely many 5-tuples of pairwise distinct integers such that each is coprime to (indices are reduced modulo 5), and the cyclic sum is an integer.
b) Show that there are infinitely many 5-tuples of pairwise distinct integers such that each is coprime to (indices are reduced modulo 5), and the cyclic sum is an integer.
Solution
a) The only 4-tuples satisfying the required conditions are along with their cyclic permutations; the cyclic sum in question is for the former and its cyclic permutations, and for the latter and its cyclic permutations. The condition that the cyclic sum of the be integral is equivalent to the cyclic sum of the being of the form for some integral . Since the are pairwise distinct, and each is coprime to , it follows that and , so . Since and are relatively prime, so are and , hence the latter is a divisor of . The required 4-tuples are now easily derived.
b) If is an integer greater than , then is a 5-tuple satisfying the required conditions; the corresponding cyclic sum is .
b) If is an integer greater than , then is a 5-tuple satisfying the required conditions; the corresponding cyclic sum is .
Final answer
a) The only 4-tuples are (1, 2, -1, -2) and (1, -2, -1, 2), together with their cyclic permutations; the cyclic sum equals −3 for the former and 3 for the latter. b) For every integer k greater than 1, the 5-tuple (1, −k, k+1, −1, −k^2 − k) satisfies the conditions; the cyclic sum equals −k^2 − 2k − 2.
Techniques
Greatest common divisors (gcd)FractionsIntegers