AMC 10 Step by Step

2023 AMC 10A Problem 16

P16-20~4 minPrint

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 40%40\% 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?

Log in to save your progress.
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

  1. Count the players. Say there are LL left-handers. Then there are 2L2L right-handers, so 3L3L players in all. The number of players is a multiple of 33.
  2. Count the games. Every pair of players meets once. With nn players, each plays n−1n - 1 others, and each game gets counted by both players, so there are n(n−1)2\frac{n(n-1)}{2} games. Try n=3,6,9,12n = 3, 6, 9, 12:
players36912
games3153666

Of these, 1515, 3636 and 6666 are among the answer choices.
3. Use the wins. Each game has exactly one winner, so total wins = total games. Suppose right-handers won 55 games. Then left-handers won 40%40\% more, which is 77. The wins come in the ratio 5:75 : 7, so the total number of wins is a multiple of 5+7=125 + 7 = 12.
4. Match the two lists. Among 1515, 3636, 6666, only 3636 is a multiple of 1212.
5. Check it can really happen. With 99 players (33 left, 66 right) and 3636 games, right-handers win 1515 and left-handers win 2121. The left-handers play 33 games among themselves and 3×6=183 \times 6 = 18 games against right-handers. If they win all 1818 of those, they have 3+18=213 + 18 = 21 wins, and the right-handers have the 1515 games among themselves. It works.

The answer is (B) 36\boxed{\textbf{(B)}\ 36}.

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 5:75 : 7 forces a multiple of 1212. 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 LL left-handed and 2L2L right-handed players, 3L3L in all. Every pair plays once, so the number of games is
(3L2)=3L(3L−1)2.\binom{3L}{2} = \frac{3L(3L-1)}{2}.
Trying L=1,2,3,4L = 1, 2, 3, 4 gives 3,15,36,663, 15, 36, 66 games; only 15,36,6615, 36, 66 appear among the choices.

Each game produces exactly one win. If right-handers won RR games, left-handers won 1.4R1.4R, so the total is 2.4R=12R52.4R = \frac{12R}{5}. For this to be an integer RR must be a multiple of 55, and then the total is a multiple of 1212. Of 15,36,6615, 36, 66, only 3636 is divisible by 1212.

Sanity check for L=3L = 3: nine players, 3636 games, left-handers win 2121 and right-handers win 1515. The three left-handers play 33 games among themselves and 1818 against right-handers; winning all 1818 plus their 33 internal games gives exactly 2121, so the scenario is achievable.

The answer is (B) 36\boxed{\textbf{(B)}\ 36}.

Review in the AoPS books

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.