Repetitions & Binomial Theorem
First, let's look at another rule, namely, the generalized bijection rule.
If we have a total function from set to set , and it is k-to-1 (each element is hit by exactly k elements), then the cardinality of is times the cardinality of :
We can use a simple example.
Let's say we want to count how many people are in a room. Given that everybody has shoes, we can count the number of shoes and divide the number by to find the number of people. In this case, set is the set of shoes, and set is the set of all people.
The number of ways to choose the set of elements among is choose , denoted by the binomial coefficient notation: .
It is defined as:
Let's look at . We can expand it, and the result will be
Now, let's look at . We get
What we're looking for here is a pattern.
And, that's where the binomial theorem comes in.
Let's look at .
There are terms in , each term will correspond to selecting or from each of the factors, which means we will have in total terms.
So, with , our is , and the factors are .
Doing the computation, all the terms we have are , , , and — adding up to .
The coefficient of is the number of 's among the terms. In the case of our example, it is (we don't need to write ).
We can call this coefficient , then represent it as .
And, the binomial formula is:
More generally, it can be written as:
Even more precisely:
There is also the multinomial coefficient, which is defined as:
One example is to find the number of permutations of length- word with a's, b's, ..., z's.
Let's look at how we can find the number of ways of rearranging the letters in the word "banana."
The question is, what is the coefficient of in the expansion of ?
Well, we can write the multinomial coefficient, which will be .
Therefore, .