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

A = B

By: Marko Petkovsek, Herbert S Wilf, Doron Zeilberger

Hardcover | 1 January 1996 | Edition Number 1

At a Glance

Hardcover


RRP $485.10

$483.99

or 4 interest-free payments of $121.00 with

 or 

Ships in 5 to 7 business days

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

Introduction to Modern Cryptography : Revised Third Edition - Jonathan Katz
IMO PROBLEMS, THEOREMS.. : COMBINATORICS - XU GUANGYU

RRP $50.99

$23.75

53%
OFF
A First Look At Graph Theory - John Clark

RRP $88.99

$80.75

Principles and Techniques in Combinatorics : Solutions Manual - Kean Pew Foo