Concrete mathematics: a foundation for computer science. 2nd ed. (English) Zbl 0836.00001

Graham, Ronald L.; Knuth, Donald E.; Patashnik, Oren

Amsterdam: Addison-Wesley Publishing Group. xiii, 657 p. (1994).

A refined and improved version of what has already become a classic. The only totally new section comes at the end of the chapter on binomial coefficients. It describes Zeilberger’s algorithm which enables computers to discover and prove binomial coefficient identities. Zeilberger’s computer specialist, Shalosh B. Ekhad, has now become a prolific author. See Zbl 0668.00003 for the review of the first edition (1989).

Reviewer: D.M.Bressoud (St.Paul)

MSC:

00A05	Mathematics in general
68-01	Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
11B65	Binomial coefficients; factorials; \(q\)-identities
11Axx	Elementary number theory
05A10	Factorials, binomial coefficients, combinatorial functions

Keywords:

basic techniques of mathematical sciences; elementary number theory; combinatorics; probability; asymptotic arguments; binomial coefficients; Zeilberger’s algorithm; binomial coefficient identities