Get Free Shipping on orders over $79
A = B : Ak Peters Ser. - Marko Petkovsek

A = B

By: Marko Petkovsek, Herbert S Wilf, Doron Zeilberger

Hardcover | 1 January 1996 | Edition Number 1

Sorry, we are not able to source the book you are looking for right now.

We did a search for other books with a similar title, however there were no matches. You can try selecting from a similar category, click on the author's name, or use the search box above to find your book.

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 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 (Maple and Mathematica) Each chapter contains an introduction to the subject and ends with a set of exercises.

More in Combinatorics & Graph Theory

Imo Problems, Theorems, And Methods : Combinatorics - Guangyu Xu
The Shrikhande Graph : A Window on Discrete Mathematics - Peter J. Cameron
The Shrikhande Graph : A Window on Discrete Mathematics - Peter J. Cameron