A = B

A = B

by Marko Petkovsek, Herbert S Wilf, Doron Zeilberger

224 pages· 1996· ISBN 9781568810638
About
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.

Discuss A = B with other readers

Join or start a book club for A = B on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for A = B?

Sign up free on Readfeed, then browse public clubs or start your own club with A = B as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss A = B with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about A = B with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.