AMC 10 Step by Step

2014 AMC 10B Problem 24

P21-25~8 minPrint

The numbers 1, 2, 3, 4, 5 are to be arranged in a circle. An arrangement is bad if it is not true that for every nn from 11 to 1515 one can find a subset of the numbers that appear consecutively on the circle that sum to nn . Arrangements that differ only by a rotation or a reflection are considered the same. How many different bad arrangements are there?

Log in to save your progress.
Show solution without answering

Key insight

What is left after removing a run of neighbors is also a run, and the two sums add to 15. So only sums 6 and 7 can fail.

Solution

Call a group of numbers that sit next to each other around the circle a run.

Step 1: shrink the list of sums to check.
1. Sums 11 to 55 are always possible: each is a single number.
2. Sum 1515 is always possible: take all five.
3. If you take a run, the numbers you did not take also sit next to each other, so they form a run too. The two runs add to 1+2+3+4+5=151 + 2 + 3 + 4 + 5 = 15. For example, if a run sums to 66, the rest sums to 99.
4. So sums 88 to 1414 are possible exactly when 77 down to 11 are. The only sums that can fail are 66 and its partner 99, and 77 and its partner 88.

An arrangement is bad exactly when it cannot make 66 or cannot make 77.

Step 2: how can 66 and 77 be made? A run of four has sum at least 1+2+3+4=101 + 2 + 3 + 4 = 10, so only runs of two or three numbers matter.
- 66: the pair 1,51, 5; the pair 2,42, 4; or the three numbers 1,2,31, 2, 3 in a row.
- 77: the pair 2,52, 5; the pair 3,43, 4; or the three numbers 1,2,41, 2, 4 in a row.

Step 3: how many arrangements are there? Put 11 at the top. The other four numbers can go clockwise in 4×3×2×1=244 \times 3 \times 2 \times 1 = 24 orders, and flipping the circle over pairs them up, so there are 1212 different arrangements. Rather than check all 1212, ask what a bad one would need.

Step 4: can 66 fail? For 66 to fail, 55 is not next to 11, and 22 is not next to 44, and 1,2,31, 2, 3 are not a run. So 11's two neighbors come from 2,3,42, 3, 4.
- Neighbors 22 and 33: then 2,1,32, 1, 3 is a run summing to 66. Good arrangement.
- Neighbors 33 and 44: the other two spots hold 22 and 55. Either 1,3,2,5,41, 3, 2, 5, 4 (run 1,3,21,3,2 makes 66) or 1,3,5,2,41, 3, 5, 2, 4 (2,42,4 are next to each other). Both good.
- Neighbors 22 and 44: the other two spots hold 33 and 55. Either 1,2,3,5,41, 2, 3, 5, 4 (run 1,2,31, 2, 3) or 1,2,5,3,41, 2, 5, 3, 4. In the last one, the neighboring pairs (1 21\,2, 2 52\,5, 5 35\,3, 3 43\,4, 4 14\,1) sum to 3,7,8,7,53, 7, 8, 7, 5, and the runs of three (1 2 51\,2\,5, 2 5 32\,5\,3, 5 3 45\,3\,4, 3 4 13\,4\,1, 4 1 24\,1\,2) sum to 8,10,12,8,78, 10, 12, 8, 7. No 66. Bad.

Step 5: can 77 fail? For 77 to fail, 55 is not next to 22, 33 is not next to 44, and 1,2,41, 2, 4 are not a run. So 55's two neighbors come from 1,3,41, 3, 4.
- Neighbors 33 and 44: the other spots hold 11 and 22, giving 5,3,x,y,45, 3, x, y, 4. With x=1x = 1: 3,1,2,43, 1, 2, 4 puts 1,2,41, 2, 4 in a run. With x=2x = 2: the circle 5,3,2,1,45, 3, 2, 1, 4 has 2,1,42, 1, 4 as a run. Both good.
- Neighbors 11 and 33: the circle is 5,1,x,y,35, 1, x, y, 3 with x,yx, y being 2,42, 4. If y=4y = 4, then 44 sits next to 33. So x=4x = 4, y=2y = 2: the circle 5,1,4,2,35, 1, 4, 2, 3 has 1,4,21, 4, 2 in a run. Good.
- Neighbors 11 and 44: the circle is 5,1,x,y,45, 1, x, y, 4 with x,yx, y being 2,32, 3. If y=3y = 3, then 33 sits next to 44. So x=3x = 3, y=2y = 2: the circle 5,1,3,2,45, 1, 3, 2, 4. Its pairs sum to 6,4,5,6,96, 4, 5, 6, 9 and its runs of three (5 1 35\,1\,3, 1 3 21\,3\,2, 3 2 43\,2\,4, 2 4 52\,4\,5, 4 5 14\,5\,1) sum to 9,6,9,11,109, 6, 9, 11, 10. No 77. Bad.

Step 6: count. The two bad arrangements are 1,2,5,3,41, 2, 5, 3, 4 (no 66) and 1,3,2,4,51, 3, 2, 4, 5 (the same circle as 5,1,3,2,45, 1, 3, 2, 4; no 77). They are different, since one can make 66 and the other cannot.

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

Why this works

On a circle, whatever is left after removing a run is also a run, so every sum comes with a partner that adds to 1515. That cuts fifteen checks down to two, sums 66 and 77. Then asking "what would have to be true for 66 to fail?" limits the neighbors of one key number and leaves only a few circles to check by hand. Look for a fact like this that shrinks the work before you start listing.

Alternative approach

Just list all 1212 circles. Start at 11, go clockwise, and to avoid counting a circle and its mirror image twice, keep only the orders where 22 comes before 55. For each, look for a run adding to 66 and a run adding to 77. Ten of the twelve have both. Only 1,2,5,3,41, 2, 5, 3, 4 (no run makes 66) and 1,3,2,4,51, 3, 2, 4, 5 (no run makes 77) fail, so there are 22 bad arrangements.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

The numbers not in a consecutive block are themselves a consecutive block, and the two sums add to 1515. So if nn is achievable, so is 15−n15 - n. The sums 11 through 55 are single numbers and 1515 is the whole circle, so an arrangement is good exactly when both 66 and 77 are achievable.

Up to rotation and reflection there are 4!2=12\frac{4!}{2} = 12 arrangements. Fix 11 at the top.

Ways to make 66: adjacent pair 1,51,5; adjacent pair 2,42,4; or the block {1,2,3}\{1,2,3\}.
Ways to make 77: adjacent pair 2,52,5; adjacent pair 3,43,4; or the block {1,2,4}\{1,2,4\}.

Arrangements missing 66. Then 11's two neighbors come from {2,3,4}\{2,3,4\}. If they are 2,32,3, the block {1,2,3}\{1,2,3\} appears. If they are 3,43,4, the far pair is {2,5}\{2,5\} and the circle is 1,3,2,5,41,3,2,5,4 (block 1,3,21,3,2 sums to 66) or 1,3,5,2,41,3,5,2,4 (2,42,4 adjacent); both make 66. If they are 2,42,4, the far pair is {3,5}\{3,5\}: 1,2,3,5,41,2,3,5,4 contains the block 1,2,31,2,3, but 1,2,5,3,41,2,5,3,4 has no 1−51{-}5 adjacency, no 2−42{-}4 adjacency, and no {1,2,3}\{1,2,3\} block. One bad arrangement.

Arrangements missing 77. Then 55's neighbors come from {1,3,4}\{1,3,4\} and 3,43,4 are not adjacent. Checking the possibilities the same way, only 1,3,2,4,51,3,2,4,5 survives: 22 touches 3,43,4; 33 touches 1,21,2; and 1,2,41,2,4 are not consecutive. One bad arrangement.

Total: 1+1=21 + 1 = 2. The answer is (B) 2\boxed{\textbf{(B)}\ 2}.

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.