Home
Evaluations
Tags
Lectures
Sandbox
About
Contribute
Evaluations
Tags
Lectures
About
Back
Question:
2018 Fall Final - 2
Author: Michiel Smid
Consider strings of length 70, in which each character is one of the letters $a, b, c$. How many such strings have exactly 12 letters $c$
and
exactly 30 letters $b$?
(a)
${70 \choose 12} + {58 \choose 30}$
(b)
${70 \choose 12} \cdot {58 \choose 30} \cdot 3^{28}$
(c)
${70 \choose 12} \cdot {58 \choose 30}$
(d)
${70 \choose 12} \cdot {58 \choose 30} \cdot 2^{28}$
COMP 2804: Discrete Structures II
COMP 2804 Final Exam
Permutations and Binomial Coefficients (3.6.2)
The Product Rule (3.1)