AMC 10 · 2014 · #24

Grade 7 geometry-2d
systematic-enumerationcomplementary-countingsymmetry-argumentcasework systematic-enumeration ↑ Prerequisites: systematic-enumeration
📏 Long solution 💡 4 insights
Problem

The numbers 1,2,3,4,51, 2, 3, 4, 5 are to be arranged in a circle. An arrangement is bad\textit{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?

.

Pick an answer.

(A)
1
(B)
2
(C)
3
(D)
4
(E)
5

AMC 10 2014 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.

Try it yourself first — the explanation is most useful after you’ve attempted it.