Home
Evaluations
Tags
Lectures
Sandbox
About
Contribute
Evaluations
Tags
Lectures
About
Back
Question:
2017 Fall Final - 7
Author: Michiel Smid
How many strings can be obtained by rearranging the letters of the word
BOOKKEEPER
(a)
$2! \cdot 2! \cdot 3!$
(b)
${10 \choose 2} \cdot {8 \choose 2} \cdot {6 \choose 3} \cdot {3 \choose 2}$
(c)
${10 \choose 2} \cdot {8 \choose 2} \cdot {6 \choose 3} \cdot 3 \cdot 2$
(d)
${10 \choose 2} \cdot {8 \choose 2} \cdot {5 \choose 3} \cdot 3 \cdot 2$
COMP 2804: Discrete Structures II
COMP 2804 Final Exam
Reordering the Letters of a Word (3.9.1)