0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing

Buy Now

A = B (Hardcover) Loot Price: R5,008
Discovery Miles 50 080
A = B (Hardcover): Marko Petkovsek, Herbert S. Wilf, Doron Zeilberger

A = B (Hardcover)

Marko Petkovsek, Herbert S. Wilf, Doron Zeilberger

 (sign in to rate)
Loot Price R5,008 Discovery Miles 50 080 | Repayment Terms: R469 pm x 12*

Bookmark and Share

Expected to ship within 12 - 17 working 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.

General

Imprint: A K Peters Ltd
Country of origin: United States
Release date: 1996
First published: 1996
Authors: Marko Petkovsek • Herbert S. Wilf • Doron Zeilberger
Dimensions: 230 x 193 x 22mm (L x W x T)
Format: Hardcover
Pages: 224
ISBN-13: 978-1-56881-063-8
Categories: Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
Books > Computing & IT > General theory of computing > General
Books > Computing & IT > Applications of computing > General
LSN: 1-56881-063-6
Barcode: 9781568810638

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners