Maths Olympiad Prep

Library / /11 of 15

Number theory Difficulty 8.2 Shortlist Prove it Romania

a) Determine all 4-tuples (x0,x1,x2,x3)(x_0, x_1, x_2, x_3) of pairwise distinct integers such that each xkx_k is coprime to xk+1x_{k+1} (indices are reduced modulo 4), and the cyclic sum x0/x1+x1/x2+x2/x3+x3/x0x_0/x_1 + x_1/x_2 + x_2/x_3 + x_3/x_0 is an integer.

b) Show that there are infinitely many 5-tuples (x0,x1,x2,x3,x4)(x_0, x_1, x_2, x_3, x_4) of pairwise distinct integers such that each xkx_k is coprime to xk+1x_{k+1} (indices are reduced modulo 5), and the cyclic sum x0/x1+x1/x2+x2/x3+x3/x4+x4/x0x_0/x_1 + x_1/x_2 + x_2/x_3 + x_3/x_4 + x_4/x_0 is an integer.

Solution

a) The only 4-tuples satisfying the required conditions are
(1,2,1,2)and(1,2,1,2) (1, 2, -1, -2) \quad \text{and} \quad (1, -2, -1, 2)
along with their cyclic permutations; the cyclic sum in question is 3-3 for the former and its cyclic permutations, and 33 for the latter and its cyclic permutations.
The condition that the cyclic sum of the xk/xk+1x_k/x_{k+1} be integral is equivalent to the cyclic sum of the xk2xk+2xk+3x_k^2 x_{k+2} x_{k+3} being of the form Nx0x1x2x3N x_0 x_1 x_2 x_3 for some integral NN. Since the xkx_k are pairwise distinct, and each xkx_k is coprime to xk+1x_{k+1}, it follows that x2=x0x_2 = -x_0 and x3=x1x_3 = -x_1, so 2(x02x12)=Nx0x12(x_0^2 - x_1^2) = N x_0 x_1. Since x0x_0 and x1x_1 are relatively prime, so are x02x12x_0^2 - x_1^2 and x0x1x_0 x_1, hence the latter is a divisor of 22. The required 4-tuples are now easily derived.

b) If kk is an integer greater than 11, then (1,k,k+1,1,k2k)(1, -k, k+1, -1, -k^2 - k) is a 5-tuple satisfying the required conditions; the corresponding cyclic sum is k22k2-k^2 - 2k - 2.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.