2023 AMC 10A Problem 16
In a table tennis tournament every participant played every other participant exactly once. Although there were twice as many right-handed players as left-handed players, the number of games won by left-handed players was more than the number of games won by right-handed players. (There were no ties and no ambidextrous players.) What is the total number of games played?
Show solution without answering
Key insight
Every game has exactly one winner, so total wins equal total games. Left wins are 1.4 times right wins, which makes the total a multiple of 12.
Solution
- Count the players. Say there are left-handers. Then there are right-handers, so players in all. The number of players is a multiple of .
- Count the games. Every pair of players meets once. With players, each plays others, and each game gets counted by both players, so there are games. Try :
| players | 3 | 6 | 9 | 12 |
|---|---|---|---|---|
| games | 3 | 15 | 36 | 66 |
Of these, , and are among the answer choices.
3. Use the wins. Each game has exactly one winner, so total wins = total games. Suppose right-handers won games. Then left-handers won more, which is . The wins come in the ratio , so the total number of wins is a multiple of .
4. Match the two lists. Among , , , only is a multiple of .
5. Check it can really happen. With players ( left, right) and games, right-handers win and left-handers win . The left-handers play games among themselves and games against right-handers. If they win all of those, they have wins, and the right-handers have the games among themselves. It works.
The answer is .
Why this works
Two separate facts each limit the total. The number of games must come from a whole number of players, and the win ratio forces a multiple of . Only one answer choice passes both tests. In any tournament problem, remember that total wins equal total games.
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Let there be left-handed and right-handed players, in all. Every pair plays once, so the number of games is
Trying gives games; only appear among the choices.
Each game produces exactly one win. If right-handers won games, left-handers won , so the total is . For this to be an integer must be a multiple of , and then the total is a multiple of . Of , only is divisible by .
Sanity check for : nine players, games, left-handers win and right-handers win . The three left-handers play games among themselves and against right-handers; winning all plus their internal games gives exactly , so the scenario is achievable.
The answer is .
Review in the AoPS books
- Intermediate Counting & Probability, Chapter 13: Events With States (§13.4)
- Introduction to Algebra, Chapter 6: Ratios and Percents
- Introduction to Number Theory, Chapter 1: Integers: The Basics (§1.4, §1.5)
- Introduction to Algebra, Chapter 7: Proportion (§7.1, §7.2, §7.3)
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.