AMC 10 · 2023 · #13

Grade 7 arithmetic
combinations-basicratio-proportionlinear-equations-one-vartriangular-numbers caseworkidentify-subproblemsbound-inequality-then-enumerate ↑ Prerequisites: combinations-basicratio-proportion
📏 Medium solution 💡 3 insights
Problem
In a tournament every player meets every other exactly once. There are twice as many right-handed players as left-handed, and the left-handers won forty percent more games than the right-handers. Find the total number of games played.

Pick an answer.

(A)
15
(B)
36
(C)
45
(D)
48
(E)
66
How to solve
Strategy Eliminate Possibilities

Multiple-choice with only five candidate values for G is the textbook signal for Tool #3 (Eliminate Possibilities). We split the work with Tool #7: extract two clean tests that any valid G must pass — (i) the 1.4-ratio of wins forces G to be a multiple of 12, and (ii) round-robin forces G to be a triangular number C(N, 2). Then test each answer choice against both filters. The unique survivor is the answer.

1STEP 1

Write the win ratio

The ratio forces a divisibility.

W_L = 1.4 W_R = 7/5W_R → G = 12/5W_R → 12 ∣ G
2STEP 2

The shape of the total

The total must be a binomial coefficient.

G = C(N, 2) = (N(N-1))/2
3STEP 3

Filter the choices

The two conditions leave two choices.

{15, 36, 45, 48, 66} → {36, 48}
4STEP 4

Check the last two

Only one is a binomial coefficient.

36 = C(9, 2) ✓, 48 ≠ C(N, 2) for any N ×
5STEP 5

Verify the actual line-up

Verifying with real counts gives 36.

R = 6, L = 3, W_R = 15, W_L = 21, W_L/W_R = 1.4 → (B) 36
Answer
36
Magnitude check: 9 players in a round-robin play C(9, 2) = 36 games, which sits comfortably between the smaller (15, 36) and larger (48, 66) options. The win counts 15 and 21 are non-negative integers and sum to the total 36 — internally consistent. The 1.4 ratio reproduces "40% more" exactly. Every answer choice except 36 fails one of the two independent filters, so the elimination is forced.
💡Key takeaway

Two clean conditions on the total — multiple of 12 from the win ratio, and a "C(N, 2) pairs" count from the round-robin — knock out four of the five choices, leaving (B) 36. When a multiple-choice problem hands you the answers, build small filters that each candidate must pass and the answer falls out.