CSCE 222 Lecture 24
Jump to navigation
Jump to search
« previous | Monday, April 4, 2011 | next »
Generating Functions (cont'd)
For , the generating function is truncated form of a geometric series:
Now use what we learned in calculus:
| if divides ; 0 otherwise. | |
| 1 if ; 0 otherwise | |
| 1 if divides ; 0 otherwise | |
Example
has a generating function of:
Extended Binomial Coefficient
Therefore
Applications of Generating Functions
Used to find the number of -combinations from a set with elements where repetitions are allowed.
Example
Let be a sequence (repetition allowed) with -combintations.
Since we can select any number of a particular element of the set when repetitions are allowed. Each element contributes to the product expansion of :
Example
Proposition.
Proof. Since is the coefficient of in , it must coincide with the coefficient of in .
is the coefficient of
in
, so the proposition must be true since
.
Q.E.D.