Problem 1
Three players , , and play the following game. On each of three cards an integer is written; the three numbers satisfy . The three cards are shuffled and one is dealt to each player, and each player receives as many counters as the number on the card they hold. The cards are shuffled and dealt again, and this is repeated for at least two rounds (counters from earlier rounds stay with the players). After the last round, has counters in all, has , and has . In the last round, received counters. Who received counters on the first round?
Step 4 of 6: Rule out
Detailed analysis
If , the two cards B received before the last round sum to . Neither card can be , since then the sum would be at least . The two cards are therefore and/or . The possibility is impossible for integer , while ; hence they must be , giving and , contradicting Step 2. Thus .