Difference between revisions of "2003 AMC 12A Problems/Problem 20"
m (→Video Solution (Meta-Solving Technique)) |
(→Solution 2 (Answer Choices)) |
||
| (6 intermediate revisions by 2 users not shown) | |||
| Line 12: | Line 12: | ||
https://youtu.be/0W3VmFp55cM?t=3737 | https://youtu.be/0W3VmFp55cM?t=3737 | ||
| − | ~ | + | ~ Sohil Rathi |
== Video Solution (Meta-Solving Techniques) == | == Video Solution (Meta-Solving Techniques) == | ||
https://youtu.be/GmUWIXXf_uk?t=260 | https://youtu.be/GmUWIXXf_uk?t=260 | ||
| − | ~ | + | ~ Sohil Rathi |
==Solution== | ==Solution== | ||
| Line 23: | Line 23: | ||
Note that the first five letters must be B's or C's, the next five letters must be C's or A's, and the last five letters must be A's or B's. If there are <math>k</math> B's in the first five letters, then there must be <math>5-k</math> C's in the first five letters, so there must be <math>k</math> C's and <math>5-k</math> A's in the next five letters, and <math>k</math> A's and <math>5-k</math> B's in the last five letters. Therefore the number of each letter in each group of five is determined completely by the number of B's in the first 5 letters, and the number of ways to arrange these 15 letters with this restriction is <math>\binom{5}{k}^3</math> (since there are <math>\binom{5}{k}</math> ways to arrange <math>k</math> B's and <math>5-k</math> C's). Therefore the answer is <math>\sum_{k=0}^{5}\binom{5}{k}^{3}</math>. | Note that the first five letters must be B's or C's, the next five letters must be C's or A's, and the last five letters must be A's or B's. If there are <math>k</math> B's in the first five letters, then there must be <math>5-k</math> C's in the first five letters, so there must be <math>k</math> C's and <math>5-k</math> A's in the next five letters, and <math>k</math> A's and <math>5-k</math> B's in the last five letters. Therefore the number of each letter in each group of five is determined completely by the number of B's in the first 5 letters, and the number of ways to arrange these 15 letters with this restriction is <math>\binom{5}{k}^3</math> (since there are <math>\binom{5}{k}</math> ways to arrange <math>k</math> B's and <math>5-k</math> C's). Therefore the answer is <math>\sum_{k=0}^{5}\binom{5}{k}^{3}</math>. | ||
| + | |||
| + | |||
| + | ==Solution 2 (Answer Choices)== | ||
| + | |||
| + | |||
| + | Note that answer choices B and E have a power of 3 in them, which is impossible since every letter only has 2 options due to the restriction. Therefore, they are automatically eliminated. | ||
| + | |||
| + | |||
| + | Answer choice C is eliminated due to the fact that not every combination is counted for in 2^15. | ||
| + | We can show this in a very simple way: | ||
| + | |||
| + | If all 5 C’s are used in the first 5 letters of the arrangements, then the next 5 letters must be A’s, as B’s are not allowed according to the question. Therefore, there is only one option for these 5 letters, showing a case not accounted for in 2^15. | ||
| + | |||
| + | |||
| + | Answer choice D is eliminated because although it finds the amount of possible arrangements, it ignores the restriction of the question (A’s cannot be in the first 5 letters, B’s in the second 5, etc.). | ||
| + | |||
| + | |||
| + | Therefore, the only remaining answer choice is <math>\boxed{\textrm{(A)}}</math>. | ||
| + | |||
| + | -SwordOfJustice | ||
==See Also== | ==See Also== | ||
Latest revision as of 00:12, 12 April 2023
Contents
Problem
How many 
-letter arrangements of 
A's, B's, and C's have no A's in the first letters, no B's in the next letters, and no C's in the last letters?
Video Solution
https://youtu.be/3MiGotKnC_U?t=2323
~ ThePuzzlr
Video Solution
https://youtu.be/0W3VmFp55cM?t=3737
~ Sohil Rathi
Video Solution (Meta-Solving Techniques)
https://youtu.be/GmUWIXXf_uk?t=260
~ Sohil Rathi
Solution
The answer is 
.
Note that the first five letters must be B's or C's, the next five letters must be C's or A's, and the last five letters must be A's or B's. If there are 
B's in the first five letters, then there must be 
C's in the first five letters, so there must be C's and A's in the next five letters, and A's and B's in the last five letters. Therefore the number of each letter in each group of five is determined completely by the number of B's in the first 5 letters, and the number of ways to arrange these 15 letters with this restriction is 
(since there are 
ways to arrange B's and C's). Therefore the answer is 
.
Solution 2 (Answer Choices)
Note that answer choices B and E have a power of 3 in them, which is impossible since every letter only has 2 options due to the restriction. Therefore, they are automatically eliminated.
Answer choice C is eliminated due to the fact that not every combination is counted for in 2^15.
We can show this in a very simple way:
If all 5 C’s are used in the first 5 letters of the arrangements, then the next 5 letters must be A’s, as B’s are not allowed according to the question. Therefore, there is only one option for these 5 letters, showing a case not accounted for in 2^15.
Answer choice D is eliminated because although it finds the amount of possible arrangements, it ignores the restriction of the question (A’s cannot be in the first 5 letters, B’s in the second 5, etc.).
Therefore, the only remaining answer choice is .
-SwordOfJustice
See Also
| 2003 AMC 12A (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 12 Problems and Solutions | |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
