AMC 10 · 2008 · #21

Grade 7 counting
permutations-basicsymmetry-argumentpair-counting caseworksystematic-enumeration ↑ Prerequisites: permutations-basic
📏 Long solution 💡 2 insights
Problem
Five numbers are written in a row, and a row counts when its first two add to less than its last two. Count the winning orderings.

Pick an answer.

(A)
36
(B)
40
(C)
44
(D)
48
(E)
52
How to solve
Strategy Change Focus / Count the Complement

Counting the heavy-tailed rows one by one means checking 120 rows, but the three classes less-than, equal, and greater-than are not independent: swapping the front pair with the back pair turns a less-than row into a greater-than row and back again. That pairing forces the two outer classes to have the same size, so the whole problem collapses to counting the small middle class where the two sums tie. Counting the ties is a short, finite listing job once the total 15 is used to pin down which middle entries are even possible.

1STEP 1

Sort all 120 rows into three classes

Every ordering falls into one of three classes.

L + E + G = 5! = 120
2STEP 2

Swap the ends to match L with G

Swapping the ends makes the first and last classes equal in size.

(a₁,a₂,a₃,a₄,a₅) ⟼ (a₄,a₅,a₃,a₁,a₂) ⟹ L = G
3STEP 3

Use the total 15 to pin the middle

The total forces the middle entry to be odd.

2s + a₃ = 15 ⟹ a₃ = 15 - 2s is odd ⟹ a₃ ∈ {1,3,5}
4STEP 4

List the balanced splits

Listing the balanced splits gives just three.

{2,5} | {3,4}, {1,5} | {2,4}, {1,4} | {2,3}
5STEP 5

Turn each split into row counts

Each split yields several orderings.

E = 3 · (2 · 2 · 2) = 24
6STEP 6

Solve for L and read the choice

Subtracting the ties and halving gives 48, choice (C).

2L = 120 - 24 = 96 ⟹ L = 96/2 = 48
Answer
48
The count 48 is less than half of 120, which is right: the 24 tie rows are taken off the top before the rest splits evenly, so neither outer pile can reach 60. It is also far above 24, matching the fact that ties are rare. A direct recount by middle entry agrees: fix a₃, split the other four into two pairs (3 ways), and note that an unbalanced split gives exactly 4 heavy-tailed rows, since the lighter pair must sit in front while the two pairs can each be ordered in 2 ways. When a₃ is odd one split is balanced and contributes nothing, giving 4 · 2 = 8 rows; when a₃ is even no split is balanced, giving 4 · 3 = 12 rows. The totals are 8, 12, 8, 12, 8 for a₃ = 1,2,3,4,5, and they add to 48, confirming (D).
💡Key takeaway

When two cases mirror each other, count only the cases stuck in the middle and let subtraction hand you the rest.

  • Sort all 120 rows into three classes
  • Swap the ends to match L with G
  • Use the total 15 to pin the middle
  • List the balanced splits
  • Turn each split into row counts
  • Solve for L and read the choice