How many ways can a student choose eight questions
from a twelve-question exam if at least three questions must be chosen
from the first five and three questions from the last seven?
Given a 9 bit binary string, how many different
encodings of that string are there which contain exactly four 1's? (E.g.,
111100000 and 001010101 are each encodings with exactly four 1's.)
