2014 AMC 10B Problem 24
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 from to one can find a subset of the numbers that appear consecutively on the circle that sum to . Arrangements that differ only by a rotation or a reflection are considered the same. How many different bad arrangements are there?
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 to are always possible: each is a single number.
2. Sum 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 . For example, if a run sums to , the rest sums to .
4. So sums to are possible exactly when down to are. The only sums that can fail are and its partner , and and its partner .
An arrangement is bad exactly when it cannot make or cannot make .
Step 2: how can and be made? A run of four has sum at least , so only runs of two or three numbers matter.
- : the pair ; the pair ; or the three numbers in a row.
- : the pair ; the pair ; or the three numbers in a row.
Step 3: how many arrangements are there? Put at the top. The other four numbers can go clockwise in orders, and flipping the circle over pairs them up, so there are different arrangements. Rather than check all , ask what a bad one would need.
Step 4: can fail? For to fail, is not next to , and is not next to , and are not a run. So 's two neighbors come from .
- Neighbors and : then is a run summing to . Good arrangement.
- Neighbors and : the other two spots hold and . Either (run makes ) or ( are next to each other). Both good.
- Neighbors and : the other two spots hold and . Either (run ) or . In the last one, the neighboring pairs (, , , , ) sum to , and the runs of three (, , , , ) sum to . No . Bad.
Step 5: can fail? For to fail, is not next to , is not next to , and are not a run. So 's two neighbors come from .
- Neighbors and : the other spots hold and , giving . With : puts in a run. With : the circle has as a run. Both good.
- Neighbors and : the circle is with being . If , then sits next to . So , : the circle has in a run. Good.
- Neighbors and : the circle is with being . If , then sits next to . So , : the circle . Its pairs sum to and its runs of three (, , , , ) sum to . No . Bad.
Step 6: count. The two bad arrangements are (no ) and (the same circle as ; no ). They are different, since one can make and the other cannot.
The answer is .
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 . That cuts fifteen checks down to two, sums and . Then asking "what would have to be true for 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 circles. Start at , go clockwise, and to avoid counting a circle and its mirror image twice, keep only the orders where comes before . For each, look for a run adding to and a run adding to . Ten of the twelve have both. Only (no run makes ) and (no run makes ) fail, so there are 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 . So if is achievable, so is . The sums through are single numbers and is the whole circle, so an arrangement is good exactly when both and are achievable.
Up to rotation and reflection there are arrangements. Fix at the top.
Ways to make : adjacent pair ; adjacent pair ; or the block .
Ways to make : adjacent pair ; adjacent pair ; or the block .
Arrangements missing . Then 's two neighbors come from . If they are , the block appears. If they are , the far pair is and the circle is (block sums to ) or ( adjacent); both make . If they are , the far pair is : contains the block , but has no adjacency, no adjacency, and no block. One bad arrangement.
Arrangements missing . Then 's neighbors come from and are not adjacent. Checking the possibilities the same way, only survives: touches ; touches ; and are not consecutive. One bad arrangement.
Total: . The answer is .
Review in the AoPS books
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques (§2.5)
- Introduction to Counting & Probability, Chapter 1: Counting Is Arithmetic
- Introduction to Algebra, Chapter 22: Special Manipulations (§22.3)
- Prealgebra, Chapter 15: Problem-Solving Strategies (§15.2)
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.