COUNTING
n!
P(n, r ) =
(n − r )!
n!
C(n, r ) = .
r !(n − r )!
C(n, r ) = C(n, n − r ).
Solution.
10!
C(10, 3) = = 120.
3!7!
Solution.
20!
C(20, 12) = = 125, 970.
12!7!
Solution.
We have a set of 10 elements where 8 elements of the same kind
which is a 01 and 2 elements of the same kind which is a 1.
Hence, there are C(10, 8) = C(10, 2) = 45 strings satisfying the given
condition.
Solution.
Solution.
Solution.
Solution.
Solution.
Solution.
Solution.
Solution.
Solution.
Solution.
Solution.
Continuation.
There are 120 + 210 + 252 + 210 + 120 = 912 strings containing at least three 1s and
at least three 0s.
Solution.
Solution.
|P(S)| = 2n .
Solution.
|P(S)| = 2n .
However, |P(S)| = C(n, 0) + C(n, 1) + · · · + C(n, n − 1) + C(n, n).
Solution.
|P(S)| = 2n .
However, |P(S)| = C(n, 0) + C(n, 1) + · · · + C(n, n − 1) + C(n, n).
Thus, 2n = C(n, 0) + C(n, 1) + · · · + C(n, n − 1) + C(n, n).