Home
Evaluations
Tags
Lectures
Sandbox
About
Contribute
Evaluations
Tags
Lectures
About
Back
Practice By Tag:
Counting Solutions of Linear Equations
Question: 2014 Fall Final - 8
1 . The number of different strings that can be made by reordering the 10 letters of the word AAABBCCCCC is
(a)
$\frac{10!}{2!3!5!}$
(b)
$10!$
(c)
${10 \choose 3}{10 \choose 2}{10 \choose 5}$
(d)
None of the above.
Submit
Refresh