CS 330 - Discrete Structures
| Generating Functions | Examples |
|
 |
|
The Binomial Theorem Cont. |
||
| Example: | |||
| We apply the procedure to the expression | |||
|
|
||
| where we let a = 1, b = (-3x2 ), and n = -1: | |||
|
|||
|
Since there are no odd powers of x, the expression is the generating function for the sequence |
||
| S = {1, 0, 3, 0 , 32 , 0 , 33, 0, ...} | |||
|
:Back to key |
Top:
 |
||