**generatingfunctionology**

by Herbert S. Wilf

**Publisher**: A K Peters, Ltd. 2006**ISBN/ASIN**: 1568812795**ISBN-13**: 9781568812793**Number of pages**: 245

**Description**:

Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. Generating functions have numerous applications in mathematics, especially in: Combinatorics; Probability Theory; Statistics; Theory of Markov Chains; and Number Theory. One of the most important and relevant recent applications of combinatorics lies in the development of Internet search engines, whose incredible capabilities dazzle even the mathematically trained user.

Download or read it online for free here:

**Download link**

(1.5MB, PDF)

## Similar books

**Introduction To Finite Mathematics**

by

**J. G. Kemeny, J. L. Snell, G. L. Thompson**-

**Prentice-Hall**

This book introduces college students to the elementary theory of logic, sets, probability theory, and linear algebra and treats a number of applications either from everyday situations or from applications to the biological and social sciences.

(

**9617**views)

**A Spiral Workbook for Discrete Mathematics**

by

**Harris Kwong**-

**Open SUNY Textbooks**

This textbook covers the standard topics in discrete mathematics: logic, sets, proof techniques, basic number theory, functions, relations, and elementary combinatorics. It explains and clarifies the unwritten conventions in mathematics.

(

**1601**views)

**Applied Finite Mathematics**

by

**Rupinder Sekhon**-

**Connexions**

Applied Finite Mathematics covers topics including linear equations, matrices, linear programming (geometrical approach and simplex method), the mathematics of finance, sets and counting, probability, Markov chains, and game theory.

(

**7275**views)

**Mathematics for Algorithm and Systems Analysis**

by

**Edward A. Bender, S. Gill Williamson**-

**Dover Publications**

This text assists undergraduates in mastering the mathematical language to address problems in the field's many applications. It consists of 4 units: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.

(

**21202**views)