Difference between revisions of "2024 AMC 10B Problems/Problem 20"
(→Problem) |
(→Solution 1) |
||
Line 7: | Line 7: | ||
==Solution 1== | ==Solution 1== | ||
+ | |||
+ | Let <math>A_R, A_L, B_R, B_L, C_R, C_L</math> denote the shoes. | ||
+ | |||
+ | |||
+ | There are <math>6</math> ways to choose the first shoe. WLOG, assume it is <math>A_R</math>. We have <math>A_R,</math> __, __, __, __, __. | ||
+ | |||
+ | |||
+ | <math>~~~~~</math> Case <math>1</math>: The next shoe in line is <math>A_L</math>. We have <math>A_R, A_L,</math> __, __, __, __. Now, the next shoe in line must be either <math>B_L</math> or <math>C_L</math>. There are <math>2</math> ways to choose which one, but assume WLOG that it is <math>B_L</math>. We have <math>A_R, A_L, B_L,</math> __, __, __. | ||
+ | |||
+ | |||
+ | <math>~~~~~ ~~~~~</math> Subcase <math>1</math>: The next shoe in line is <math>B_R</math>. We have <math>A_R, A_L, B_L, B_R,</math> __, __. The only way to finish is <math>A_R, A_L, B_L, B_R, C_R, C_L</math>. | ||
+ | |||
+ | |||
+ | <math>~~~~~ ~~~~~</math> Subcase <math>2</math>: The next shoe in line is <math>C_L</math>. We have <math>A_R, A_L, B_L, C_L,</math> __, __. The only way to finish is <math>A_R, A_L, B_L, C_L, C_R, B_R</math>. | ||
+ | |||
+ | |||
+ | <math>~~~~~</math> In total, this case has <math>(6)(2)(1 + 1) = 24</math> orderings. | ||
+ | |||
+ | |||
+ | <math>~~~~~</math> Case <math>2</math>: The next shoe in line is either <math>B_R</math> or <math>C_R</math>. There are <math>2</math> ways to choose which one, but assume WLOG that it is <math>B_R</math>. We have <math>A_R, B_R,</math> __, __, __, __. | ||
+ | |||
+ | |||
+ | <math>~~~~~ ~~~~~</math> Subcase <math>1</math>: The next shoe is <math>B_L</math>. We have <math>A_R, B_R, B_L,</math> __, __, __. | ||
+ | |||
+ | |||
+ | <math>~~~~~ ~~~~~ ~~~~~</math> Sub-subcase <math>1</math>: The next shoe in line is <math>A_L</math>. We have <math>A_R, B_R, B_L, A_L,</math> __, __. The only way to finish is <math>A_R, B_R, B_L, A_L, C_L, C_R</math>. | ||
+ | |||
+ | |||
+ | <math>~~~~~ ~~~~~ ~~~~~</math> Sub-subcase <math>2</math>: The next shoe in line is <math>C_L</math>. We have <math>A_R, B_R, B_L, C_L,</math> __, __. The remaining shoes are <math>C_R</math> and <math>A_L</math>, but these shoes cannot be next to each other, so this sub-subcase is impossible. | ||
+ | |||
+ | |||
+ | <math>~~~~~ ~~~~~</math> Subcase <math>2</math>: The next shoe is <math>C_R</math>. We have <math>A_R, B_R, C_R,</math> __, __, __. The next shoe in line must be <math>C_L</math>, so we have <math>A_R, B_R, C_R, C_L,</math> __, __. There are <math>2</math> ways to finish, which are <math>A_R, B_R, C_R, C_L, A_L, B_L</math> and <math>A_R, B_R, C_R, C_L, B_L, A_L</math>. | ||
+ | |||
+ | |||
+ | <math>~~~~~</math> In total, this case has <math>(6)(2)(1 + 2) = 36</math> orderings. | ||
+ | |||
+ | |||
+ | Our final answer is <math>24 + 36 = \boxed{\textbf{(A) } 60}</math> | ||
==See also== | ==See also== | ||
{{AMC10 box|year=2024|ab=B|num-b=19|num-a=21}} | {{AMC10 box|year=2024|ab=B|num-b=19|num-a=21}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 04:00, 14 November 2024
Problem
Three different pairs of shoes are placed in a row so that no left shoe is next to a right shoe from a different pair. In how many ways can these six shoes be lined up?
Solution 1
Let denote the shoes.
There are ways to choose the first shoe. WLOG, assume it is . We have __, __, __, __, __.
Case : The next shoe in line is . We have __, __, __, __. Now, the next shoe in line must be either or . There are ways to choose which one, but assume WLOG that it is . We have __, __, __.
Subcase : The next shoe in line is . We have __, __. The only way to finish is .
Subcase : The next shoe in line is . We have __, __. The only way to finish is .
In total, this case has orderings.
Case : The next shoe in line is either or . There are ways to choose which one, but assume WLOG that it is . We have __, __, __, __.
Subcase : The next shoe is . We have __, __, __.
Sub-subcase : The next shoe in line is . We have __, __. The only way to finish is .
Sub-subcase : The next shoe in line is . We have __, __. The remaining shoes are and , but these shoes cannot be next to each other, so this sub-subcase is impossible.
Subcase : The next shoe is . We have __, __, __. The next shoe in line must be , so we have __, __. There are ways to finish, which are and .
In total, this case has orderings.
Our final answer is
See also
2024 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 19 |
Followed by Problem 21 | |
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.