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.
Cumpărați această carte electronică și primiți încă 1 GRATUIT!
Limba Engleză ● Format PDF ● Pagini 192 ● ISBN 9781439864395 ● Editura CRC Press ● Publicat 2005 ● Descărcabil 3 ori ● Valută EUR ● ID 4092177 ● Protecție împotriva copiilor Adobe DRM
Necesită un cititor de ebook capabil de DRM