2022 AMC 8 Problems/Problem 14
Revision as of 17:43, 28 January 2022 by MRENTHUSIASM (talk | contribs) (Created page with "==Problem== In how many ways can the letters in <math>\textbf{BEEKEEPER}</math> be rearranged so that two or more <math>\textbf{E}</math>s do not appear together? <math>\tex...")
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
The problem is equivalent to counting the arrangements of
and
into the four blanks, in which there are
ways.
~MRENTHUSIASM
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.