LATEST DISCOUNTS & SALES: PROMOTIONS

Close Notification

Your cart does not contain any items

$124

Paperback

Not in-store but you can order this
How long will it take?

QTY:

English
CRC Press
02 December 2019
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.

By:   , ,
Imprint:   CRC Press
Country of Publication:   United Kingdom
Dimensions:   Height: 235mm,  Width: 191mm, 
Weight:   453g
ISBN:   9780367448714
ISBN 10:   0367448718
Pages:   230
Publication Date:  
Audience:   Professional and scholarly ,  Undergraduate
Format:   Paperback
Publisher's Status:   Active
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

Petkovsek, Marko; Wilf, Herbert S; Zeilberger, Doron

See Also