CS 330 - Discrete Structures
| Generating Functions | Examples |
|
 |
|
Solving Recurrence Relations Cont. | ||
| Example: | |||
| e | Solve the nonhomogeneous recurrence system | ||
| an = 3an-2 + 1, a0 = a1 = 1 | |||
|
Solution: | ||
| e |
Multiply each term on both sides of the equationby xn and sum from 2 to infinity to produce: |
||
|
|||
| e |
Now adding a0 + a1x to both sides and using
the initial conditions we have |
||
|
|||
|
e | which gives | |
|
|||
| e | or | ||
|
|||
| e | or | ||
|
|||
|
:Back to key |
Top:
 |
||