1985 AHSME Problems/Problem 11

Revision as of 23:51, 2 April 2018 by Hapaxoromenon (talk | contribs) (Slightly simplified the solution)

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 can separate each rearrangement into two parts: the vowels and the consonants. There are $2$ possibilities for the first value and $1$ for the remaining one, for a total of $2\cdot1=2$ possible orderings of the vowels. There are similarly a total of $5 \cdot1=120$ possible orderings of the consonants. However, since both T's are indistinguishable, we must divide this total by $2!=2$. Thus, the actual number of total orderings of consonants is $120 \div 2=60$. Thus In total, there are $2\cdot60=120$ possible rearrangements, $\fbox{\text{(B)}}$.

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