•
1 1

Generatingfunctionology

Wilf, Herbert S.
Available
- 256 Pages
Published: 20/12/2005

£54.89
£48.99 £54.89
Sale Sold out
Condition
Share this product with your friends.

Summary

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.

Shopping for books made easy

  • FAST UK Delivery
  • Support small business
  • Despatched in fully recyclable packaging
  • Excellent customer service
  • Summary
  • Author
  • Product Details
  • Review

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.

  • FREE UK delivery for all orders over £20

    Worldwide shipping from £2.99

  • Over 6 million books available and ready to ship!

  • Excellent customer service & over 3 million satisfied customers