Jump to ratings and reviews

A = B

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.

230 pages, Hardcover

First published January 1, 1996

Loading...
Loading...

About the author

Ratings & Reviews

What do you think?

Friends & Following

Create a free account to discover what your friends think of this book!

Community Reviews

5 stars
5 (45%)
4 stars
4 (36%)
3 stars
1 (9%)
2 stars
0 (0%)
1 star
1 (9%)
Displaying 1 - 1 of 1 review
Profile Image for Chris.
142 reviews43 followers
December 31, 2018
a disgusting and terrible book. I liked Wilf's OGF stuff, but very much don't see the value or point in A=B. This is like Knuth, horrible and full of itself.
Displaying 1 - 1 of 1 review