09.12.2012 Views

Concrete mathematics : a foundation for computer science

Concrete mathematics : a foundation for computer science

Concrete mathematics : a foundation for computer science

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

6 EXERCISES 305<br />

89 Develop a general theory of the solutions to the two-parameter recurrence<br />

= (an+ @+y)<br />

+(a’n+/3’k+y’) +[n=k=OI, <strong>for</strong>n,k30,<br />

assuming that [:I = 0 h<br />

w en n < 0 or k < 0. (Binomial coefficients,<br />

Stirling numbers, Eulerian numbers, and the sequences of exercises 17<br />

and 31 are special cases.) What special values (LX, fl,r, CX’, fi’,~‘) yield<br />

“fundamental solutions” in terms of which the general solution can be<br />

expressed?

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!