1.
Consider the set of 7-bit strings of weight 3. That is, strings of 0s and 1s that are seven characters long and have exactly three 1s. How many such strings are there?
(a)
Give the answer as a single binomial coefficient.
(b)
Now count just those 7-bit strings of weight 3 that start with a 1. How many are there?
(c)
Now count just those 7-bit strings of weight 3 that start with 01. How many are there?
(d)
Now count just those 7-bit strings of weight 3 that start with 001. How many are there?
(e)
Continue this process until you have counted all 7-bit strings of weight 3, as a sum of binomial coefficients. What is this sum?