AMC 8 · 2019 · #19

Grade 4 logiccounting
systematic-enumerationlogical-deductionoptimization-counting caseworkoptimization-countingidentify-subproblems ↑ Prerequisites: logical-deductionmulti-digit-arithmetic
📏 Long solution 💡 3 insights
📘 View easy version →
Problem
Six teams play a round-robin in which every pair meets exactly twice. A win is worth 3 points, a draw 1 point, and a loss 0 points. After all 30 games are played, the three teams at the top of the standings end up with the same total number of points. What is the largest score those three top teams can share?

Pick an answer.

(A)
22
(B)
23
(C)
24
(D)
26
(E)
30

AMC 8 2019 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.

How to solve
Strategy Identify Subproblems

The cleanest move is to split the 10 games each top team plays into two groups: (i) games against the three bottom teams (where the top team is free to win every time) and (ii) games against the other two top teams (where every point earned by one top team is a point denied to another). That is exactly Tool #7 (Identify Subproblems). After we compute the best score using this split, Tool #3 (Eliminate Possibilities) lets us check the leftover answer choices — especially 26 and 30 — to confirm 24 is the maximum that is actually achievable.

1STEP 1

Call the top three A, B, C, the rest D, E, F. Each plays 10 games: 6 outside its group, 4 inside — so handle the two kinds separately.

6 outside games + 4 inside games = 10 games per team
2STEP 2

Subproblem 1: each leader beats D, E, F in both meetings — 6 wins — for 18 points from outside games, with no clash between leaders.

6 wins × 3 pts/win = 18 pts per top team from outside games
3STEP 3

Subproblem 2: the 6 inside games pay 3 points only when decisive, so 18 at most, split three ways to 6 points each — if reachable.

(6games×3pts)(3teams)\frac{(6 games × 3 pts)}{(3 teams)} = 6 pts each (upper bound)
4STEP 4

Make it reachable: in each pair (A–B, A–C, B–C) split the two games one win apiece, so every leader goes 2–2 inside for 6 points.

2 × 3 + 2 × 0 = 6 pts per top team from inside games
5STEP 5

Add the two parts: 24 points per leader — achievable and equal, so the answer is (C).

18 + 6 = 24 → (C)
6STEP 6

Bigger choices fail: 30 needs all wins (impossible among leaders); 26 needs 24 inside points but only 18 exist — so 24 is the max.

Max total inside points = 6 × 3 = 18 < 24 = 3 × 8 → 26 impossible
Answer
24
Total points awarded across all 30 games is at most 30 × 3 = 90 (only if every game is decisive). If the three top teams each had 24, they share 72 of those 90 points and the three bottom teams share at most 90 - 72 = 18 — which is easy (D, E, F split their internal 6 games, scoring 6 points each, total 18, while losing every game to the top). Numbers balance, so 24 is consistent with the whole tournament accounting.
💡Key takeaway

This AMC 8 problem only needs Grade 4 multi-step word-problem reasoning you already know — split the games into two groups, multiply, and add!