**A=B**

by Marko Petkovsek, Herbert S. Wilf, Doron Zeilberger

**Publisher**: AK Peters, Ltd. 1996**ISBN/ASIN**: 1568810636**ISBN-13**: 9781568810638**Number of pages**: 217

**Description**:

This book introduces the idea of hypergeometric function, the Swiss army knife of combinatorial mathematics, and proceeds to develop algorithms for their computation as well as numerous applications. The authors also reveal what, exactly, computers can help us to decide, what is a "closed form" solution, what are "canonical" and "normal" forms, and inject relevant philosophical digressions that keep the discussions lively and entertaining. The authors also present snippets of "Mathematica" code so that you can try out many of the basic operations yourself.

Download or read it online for free here:

**Download link**

(1.2MB, PDF)

## Similar books

**Think Data Structures**

by

**Allen B. Downey**-

**Green Tea Press**

This book is intended for college students in computer science and related fields. The book also presents basic aspects of software engineering practice, including version control and unit testing. Each chapter ends with an exercises.

(

**5747**views)

**Algorithms**

by

**Robert Sedgewick, Kevin Wayne**-

**Addison-Wesley Professional**

This textbook surveys the most important algorithms and data structures in use today. Applications to science, engineering, and industry are a key feature of the text. We motivate each algorithm by examining its impact on specific applications.

(

**7199**views)

**Algorithmic Mathematics**

by

**Leonard Soicher, Franco Vivaldi**-

**Queen Mary University of London**

This text is a course in mathematical algorithms, intended for second year mathematics students. It introduces the algorithms for computing with integers, polynomials and vector spaces. The course requires no computing experience.

(

**18477**views)

**Algorithms and Complexity**

by

**Herbert S. Wilf**-

**AK Peters, Ltd.**

An introductory textbook on the design and analysis of algorithms. Recursive algorithms are illustrated by Quicksort, FFT, and fast matrix multiplications. Algorithms in number theory are discussed with some applications to public key encryption.

(

**15144**views)