1985 AHSME Problems/Problem 11

Revision as of 19:40, 19 March 2024 by Sevenoptimus (talk | contribs) (Improved solution and formatting)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

How many distinguishable rearrangements of the letters in $CONTEST$ have both the vowels first? (For instance, $OETCNST$ is one such arrangement, but $OTETSNC$ is not.)

$\mathrm{(A)\ } 60 \qquad \mathrm{(B) \ }120 \qquad \mathrm{(C) \  } 240 \qquad \mathrm{(D) \  } 720 \qquad \mathrm{(E) \  }2520$

Solution

We consider the vowels and consonants separately. There are $2$ vowels ($O$ and $E$), giving $2! = 2$ choices for the first two letters; similarly, there are $5$ consonants ($C$, $N$, $S$, and two $T$s), which would give $5! = 120$ possible choices for letters $3$ to $7$, except that since the two $T$s are indistinguishable, this actually counts each order exactly twice. Therefore the number of possible orderings of the consonants is $\frac{120}{2} = 60$, giving a total of $2 \cdot 60 = \boxed{\text{(B)} \ 120}$ possible rearrangements.

See Also

1985 AHSME (ProblemsAnswer KeyResources)
Preceded by
Problem 10
Followed by
Problem 12
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 26 27 28 29 30
All AHSME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png