Maths Olympiad Prep

Library / /52 of 86

Combinatorics Difficulty 7.0 National Olympiad Prove it United States

Problem:

Ara and Bea play a game where they take turns putting numbers from 11 to 55 into the cells of the XX-shaped diagram on the right. Each number must be played exactly once, and a cell cannot have more than one number placed in it. Ara's goal is for the two diagonals of the XX diagram to have the same sum when the game is over; Bea's goal is for these two sums to be unequal.

a) Show that Ara can always win if he goes first.

b) Show that Bea can always win if she goes first.

Figure 1

Solution

Solution:

a.
Suppose Ara goes first. He can begin by placing a 55 in the center of the board. This is the only space shared by both diagonals, so when the game is over, the two diagonal sums are guaranteed to add up to 1+2+3+4+5+5=201+2+3+4+5+5=20.

For her first move, Bea must play some number nn in one of the four corner spaces, where n=1,2,3,n=1,2,3, or 44. Ara can then respond by playing 5n5-n in the opposite corner, completing a diagonal. (We know this move is still available, because 5n5-n is either 1,2,3,1,2,3, or 44, and cannot be equal to nn.)

After these three moves, the sum of the completed diagonal is 5+n+(5n)=105+n+(5-n)=10. Since the two diagonal sums will add up to 2020 at the end of the game, the other diagonal sum will also be 1010. Thus Ara will win.

b.
Suppose Bea goes first. She can begin by placing a 22 in the center of the board. By the same reasoning as in part (a), the two diagonal sums are now guaranteed to add up to 1+2+3+4+5+2=171+2+3+4+5+2=17 at the end of the game.

For the diagonal sums to be equal, each diagonal sum would have to be 172\frac{17}{2}. But the diagonal sums are integers, so this cannot happen. Therefore, no matter what the remaining moves are, Bea will win.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.