**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

**Data Structures and Algorithms: Annotated Reference with Examples**

by

**Granville Barnett, Luca Del Tongo**-

**DotNetSlackers**

The book provides implementations of common and uncommon algorithms in pseudocode which is language independent and provides for easy porting to most programming languages. We assume that the reader is familiar with the object oriented concepts.

(

**11778**views)

**Algorithms: Fundamental Techniques**

by

**Macneil Shonle, Matthew Wilson, Martin Krischik**-

**Wikibooks**

An accessible introduction into the design and analysis of efficient algorithms. It explains only the most basic techniques, and gives intuition for and an introduction to the rigorous mathematical methods needed to describe and analyze them.

(

**10952**views)

**Algorithms and Data Structures: With Applications to Graphics and Geometry**

by

**Jurg Nievergelt, Klaus Hinrichs**-

**Prentice Hall**

Contents: Programming environments for motion, graphics, and geometry; Programming concepts - beyond notation; Objects, algorithms, programs; Complexity of problems and algorithms; Data structures; Interaction between algorithms and data structures.

(

**2733**views)

**Algorithms for Modular Elliptic Curves**

by

**J. E. Cremona**-

**Cambridge University Press**

The author describes the construction of modular elliptic curves giving an algorithm for their computation. Then algorithms for the arithmetic of elliptic curves are presented. Finally, the results of the implementations of the algorithms are given.

(

**10506**views)