Maths Olympiad Prep

Track / Stage 5 / 300 of 400 #1380 of 2444

Problem 1380

AIME late
Combinatorics Difficulty 5.7 Prove it HMMT November · United States · 2015

Bassanio has three red coins, four yellow coins, and five blue coins. At any point, he may give Shylock any two coins of different colors in exchange for one coin of the other color; for example, he may give Shylock one red coin and one blue coin, and receive one yellow coin in return. Bassanio wishes to end with coins that are all the same color, and he wishes to do this while having as many coins as possible. How many coins will he end up with, and what color will they be?

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

Solution:

Let r,y,br, y, b denote the numbers of red, yellow, and blue coins respectively. Note that each of the three possible exchanges do not change the parities of yry - r, byb - y, or brb - r, and eventually one of these differences becomes zero. Since brb - r is the only one of these differences that is originally even, it must be the one that becomes zero, and so Bassanio will end with some number of yellow coins. Furthermore, Bassanio loses a coin in each exchange, and he requires at least five exchanges to rid himself of the blue coins, so he will have at most 125=712 - 5 = 7 yellow coins at the end of his trading.

It remains to construct a sequence of trades that result in seven yellow coins. First, Bassanio will exchange one yellow and one blue coin for one red coin, leaving him with four red coins, three yellow coins, and four blue coins. He then converts the red and blue coins into yellow coins, resulting in 7 yellow coins, as desired.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.