| Description |
1 online resource |
| Contents |
chapter I Background -- chapter II The Five Basic Algorithms -- chapter III Epilogue |
| Summary |
"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."--Provided by publisher |
| Subjects |
Mathematics
|
|
Combinatorial analysis
|
| Other Name |
Wilf, Herbert S, author
|
|
Zeilberger, Doron, author
|
| Other Title |
Taylor & Francis (CRC Press). OCU
|
| ISBN |
9780429064586 (e-book : PDF) |
|
9781568810638 (hardback) |
| Other Std # |
10.1201/9781439864500 doi |
| Link |
Print version: 9781568810638 (DLC) 95051210 |
|
