generatingfunctionology: Third Edition 3rd edition

Generating functions, amongst the most important tools in enumerative mathematics, are a bridge between discrete mathematics and continuous analysis. Generating functions are common in combinatorics, probability theory, statistics, the theory of Markov chains, and number theory. Wilf (mathematics, U. of Pennsylvania) provides instructions on using Maple and Mathematica from his introductory ideas and examples on though his coverage of series, the exponential formula, applications of generating functions, and analytic and asymptotic methods. Annotation ©2006 Book News, Inc., Portland, OR (booknews.com)
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 - 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.