139,22 €
154,69 €
-10% with code: EXTRA
generatingfunctionology
generatingfunctionology
139,22
154,69 €
  • We will send in 10–14 business days.
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 mathe…
154.69
  • Publisher:
  • ISBN-10: 1568812795
  • ISBN-13: 9781568812793
  • Format: 15.2 x 22.9 x 1.6 cm, kieti viršeliai
  • Language: English
  • SAVE -10% with code: EXTRA

generatingfunctionology (e-book) (used book) | bookbook.eu

Reviews

(4.58 Goodreads rating)

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.

EXTRA 10 % discount with code: EXTRA

139,22
154,69 €
We will send in 10–14 business days.

The promotion ends in 22d.20:43:20

The discount code is valid when purchasing from 10 €. Discounts do not stack.

Log in and for this item
you will receive 1,55 Book Euros!?
  • Author: Herbert S Wilf
  • Publisher:
  • ISBN-10: 1568812795
  • ISBN-13: 9781568812793
  • Format: 15.2 x 22.9 x 1.6 cm, kieti viršeliai
  • Language: English English

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.

Reviews

  • No reviews
0 customers have rated this item.
5
0%
4
0%
3
0%
2
0%
1
0%
(will not be displayed)