menu
{ "item_title" : "generatingfunctionology", "item_author" : [" Herbert S. Wilf "], "item_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 - 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.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/1/56/881/279/1568812795_b.jpg", "price_data" : { "retail_price" : "76.99", "online_price" : "76.99", "our_price" : "76.99", "club_price" : "76.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
generatingfunctionology|Herbert S. Wilf

generatingfunctionology : Third Edition

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9781568812793
  • ISBN-10: 1568812795
  • Publisher: A K PETERS
  • Publish Date: December 2005
  • Dimensions: 9 x 6 x 0.63 inches
  • Shipping Weight: 1.13 pounds
  • Page Count: 256

Related Categories

You May Also Like...

    1

BAM Customer Reviews