Maths Olympiad Prep

Library / /3 of 11

, 2013

Combinatorics Difficulty 7.8 National olympiad, round 2 Prove it Saudi Arabia

Determine whether it is possible to place the integers 1,2,,20121,2, \ldots, 2012 in a circle in such a way that the 2012 products of adjacent pairs of numbers leave pairwise distinct remainders when divided by 2013.

Solution

Assume that it is possible to place the integers 1,2,,20121,2, \ldots, 2012 in a circle in such a way that the 2012 products of adjacent pairs of numbers leave pairwise distinct remainders when divided by 2013. Let a1,a2,,a2012a_{1}, a_{2}, \ldots, a_{2012} be such a reordering of the integers 1,2,,20121,2, \ldots, 2012 on the circle.

Because 2013=3×11×612013=3 \times 11 \times 61, a number is a multiple of 33 or 1111 or 6161 if and only if its remainder when divided by 20132013 is a multiple of 33 or 1111 or 6161.

By the pigeonhole principle, there are at least two adjacent numbers in the list a1,a2,,a2012a_{1}, a_{2}, \ldots, a_{2012} which are not multiples of 33. Make this list starting from these two adjacent numbers and consider the list b1,b2,,b2012b_{1}, b_{2}, \ldots, b_{2012} of their products, where bi=aiai+1b_{i}=a_{i} \cdot a_{i+1}, for i=1,,2012i=1, \ldots, 2012 with a2013=a1a_{2013}=a_{1}.

Consider ai1,ai2,,ai670a_{i_{1}}, a_{i_{2}}, \ldots, a_{i_{670}}, all the multiples of 33 with 2<i1<i2<<i6702<i_{1}<i_{2}<\cdots<i_{670}. It is clear that bi1,bi2,,bi670b_{i_{1}}, b_{i_{2}}, \ldots, b_{i_{670}} are all multiples of 33 and that bi11,bi21,,bi6701b_{i_{1}-1}, b_{i_{2}-1}, \ldots, b_{i_{670}-1} are also all multiples of 33. So their remainders when divided by 20132013 are all multiples of 33. But there are only 671671 different multiples of 33 between 00 and 20122012 included. Therefore ij+1=ij+1i_{j+1}=i_{j}+1 for all j=1,,669j=1, \ldots, 669. This means that the multiples of 33 in the list a1,a2,,a2012a_{1}, a_{2}, \ldots, a_{2012} form a block and are not separated by any non-multiple of 33.

In a similar way we prove that multiples of 1111 form a block in this list and that multiples of 6161 form also a block in this list. But since there are common multiples of 33 and 1111, their blocks must be connected to each other. For the same reason the 33 blocks must be connected by pairs to each other.

But, in each block, there are numbers which are in none of the two other blocks, for example there are multiples of 33 which are neither multiples of 1111 nor multiples of 6161 like 3,6,93,6,9, and the same thing happens for 1111 and 6161. So, these numbers are in the middle of each of the blocks and make the blocks intersecting only in their sides. There are also numbers which are not multiples of any of these 33 numbers, like 1,2,41,2,4. So, these numbers will prevent two of the three blocks to intersect, and here is the contradiction.

Hence, it is not possible to place the integers 1,2,,20121,2, \ldots, 2012 in a circle under the given condition.

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.