Difference between revisions of "2014 AMC 10B Problems/Problem 24"
(→Solution) |
(→Solution) |
||
| Line 6: | Line 6: | ||
==Solution== | ==Solution== | ||
| − | We see that there are <math>5!</math> total ways to arrange the numbers. However, we can always rotate these numbers so that, for example, the number 1 is always at the top of the circle. Thus, there are only <math>4!</math> ways under rotation, which is not difficult to list out. We systematically list out all <math>24</math> cases. Now, we must examine if they satisfy the conditions. We can see that by choosing one number at a time, we can always obtain subsets with sums 1, 2, 3, 4, and 5. By choosing the full circle, we can obtain 15. By choosing everything except for 1, 2, 3, 4, and 5, we can obtain subsets with sums of 10, 11, 12, 13, and 14. This means that we now only need to check for 6, 7, 8, and 9. However, once we have found a set summing to 6, we can choose everything else and obtain a set summing to 9, and similarly for 7 and 8. | + | We see that there are <math>5!</math> total ways to arrange the numbers. However, we can always rotate these numbers so that, for example, the number 1 is always at the top of the circle. Thus, there are only <math>4!</math> ways under rotation, which is not difficult to list out. We systematically list out all <math>24</math> cases. Now, we must examine if they satisfy the conditions. We can see that by choosing one number at a time, we can always obtain subsets with sums 1, 2, 3, 4, and 5. By choosing the full circle, we can obtain 15. By choosing everything except for 1, 2, 3, 4, and 5, we can obtain subsets with sums of 10, 11, 12, 13, and 14. This means that we now only need to check for 6, 7, 8, and 9. However, once we have found a set summing to 6, we can choose everything else and obtain a set summing to 9, and similarly for 7 and 8. Thus, we only need to check each case for weather or not we can obtain 6 or 7. We find that there are only 4 arrangements that satisfy these conditions. However, each of these is a reflection of another. We divide by 2 for these reflections to obtain a final answer of <math>(B) 2</math>. |
==See Also== | ==See Also== | ||
{{AMC10 box|year=2014|ab=B|num-b=23|num-a=25}} | {{AMC10 box|year=2014|ab=B|num-b=23|num-a=25}} | ||
{{MAA Notice}} | {{MAA Notice}} | ||
Revision as of 14:53, 20 February 2014
Problem
The numbers 1, 2, 3, 4, 5 are to be arranged in a circle. An arrangement is 
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?
Solution
We see that there are 
total ways to arrange the numbers. However, we can always rotate these numbers so that, for example, the number 1 is always at the top of the circle. Thus, there are only 
ways under rotation, which is not difficult to list out. We systematically list out all 
cases. Now, we must examine if they satisfy the conditions. We can see that by choosing one number at a time, we can always obtain subsets with sums 1, 2, 3, 4, and 5. By choosing the full circle, we can obtain 15. By choosing everything except for 1, 2, 3, 4, and 5, we can obtain subsets with sums of 10, 11, 12, 13, and 14. This means that we now only need to check for 6, 7, 8, and 9. However, once we have found a set summing to 6, we can choose everything else and obtain a set summing to 9, and similarly for 7 and 8. Thus, we only need to check each case for weather or not we can obtain 6 or 7. We find that there are only 4 arrangements that satisfy these conditions. However, each of these is a reflection of another. We divide by 2 for these reflections to obtain a final answer of 
.
See Also
| 2014 AMC 10B (Problems • Answer Key • Resources) | ||
| Preceded by Problem 23 |
Followed by Problem 25 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
| All AMC 10 Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
