230 Pages
by
A K Peters/CRC Press
230 Pages
by
A K Peters/CRC Press
224 Pages
by
A K Peters/CRC Press
Also available as eBook on:
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. From the table of contents: * Proof Machines * Tightening... Read more
I: Background 1. Proof Machines 2. Tightening the Target 3. The Hypergeometric Database II: The Five Basic Algorithms 4. Sister Celine’s Method 5. Gosper’s Algorithm 6. Zeilberger’s Algorithm 7. The WZ Phenomenon 8. Algorithm Hyper III: Epilogue 9. An Operator Algebra Viewpoint
Biography
Petkovsek, Marko; Wilf, Herbert S; Zeilberger, Doron
