Petkovsek M., Wilf H.S., Zeilberger D. A=B

Boston: Addison Wesley, 1997. — 208 p.This book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method for analyzing complex summations. Beautifully written, the book contains practical applications as well as conceptual developments that will have applications in other areas of mathematics.Proof Machines.
Tightening the Target.
The Hypergeometric Database.
The Five Basic Algorithms.
Sister Celine's Method.
Gosper's Algorithm.
Zeilberger's Algorithm.
The WZ Phenomenon.
Algorithm Hyper.
Epilogue.
An Operator Algebra Viewpoint.
The WWW sites and the software.