Difference between revisions of "2022 AMC 8 Problems/Problem 14"
Cellsecret (talk | contribs) (→Solution) |
Mcdsouza2025 (talk | contribs) |
||
| Line 15: | Line 15: | ||
~Interstigation | ~Interstigation | ||
| + | |||
| + | ==Video Solution== | ||
| + | https://youtu.be/p29Fe2dLGs8?t=212 | ||
| + | |||
| + | ~STEMbreezy | ||
==See Also== | ==See Also== | ||
{{AMC8 box|year=2022|num-b=13|num-a=15}} | {{AMC8 box|year=2022|num-b=13|num-a=15}} | ||
{{MAA Notice}} | {{MAA Notice}} | ||
Revision as of 20:20, 25 December 2022
Problem
In how many ways can the letters in 
be rearranged so that two or more 
s do not appear together?
Solution
All valid arrangements of the letters must be of the form ![\[\textbf{E\underline{\hspace{3mm}}E\underline{\hspace{3mm}}E\underline{\hspace{3mm}}E\underline{\hspace{3mm}}E}.\]](http://latex.artofproblemsolving.com/3/e/c/3ecf6e61439838584cdc342894a7e76208755b5c.png)
The problem is equivalent to counting the arrangements of 
and 
into the four blanks, in which there are 
ways.
~MRENTHUSIASM
Video Solution
https://youtu.be/Ij9pAy6tQSg?t=1222
~Interstigation
Video Solution
https://youtu.be/p29Fe2dLGs8?t=212
~STEMbreezy
See Also
| 2022 AMC 8 (Problems • Answer Key • Resources) | ||
| Preceded by Problem 13 |
Followed by Problem 15 | |
| 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 AJHSME/AMC 8 Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
