SKU/Artículo: AMZ-1032919779

How to Count

Format:

Paperback

Hardcover

Paperback

eTextbook

Detalles del producto
Disponibilidad:
En stock
Peso con empaque:
0.98 kg
Devolución:
No
Condición
Nuevo
Producto de:
Amazon
Viaja desde
USA

Sobre este producto
  • Emphasizes a Problem Solving Approach A first course in combinatoricsCompletely revised, How to Count: An Introduction to Combinatorics, Second Edition shows how to solve numerous classic and other interesting combinatorial problems. The authors take an easily accessible approach that introduces problems before leading into the theory involved. Although the authors present most of the topics through concrete problems, they also emphasize the importance of proofs in mathematics.New to the Second Edition This second edition incorporates 50 percent more material. It includes seven new chapters that cover occupancy problems, Stirling and Catalan numbers, graph theory, trees, Dirichlet’s pigeonhole principle, Ramsey theory, and rook polynomials. This edition also contains more than 450 exercises. Ideal for both classroom teaching and self-study, this text requires only a modest amount of mathematical background. In an engaging way, it covers many combinatorial tools, such as the inclusion-exclusion principle, generating functions, recurrence relations, and Pólya’s counting theorem.
S/ 538.58
55% OFF
S/ 244.80

IMPORT EASILY

By purchasing this product you can deduct VAT with your RUT number

S/ 538.58
55% OFF
S/ 244.80

Hasta 6 cuotas sin intereses con BCP, BBVA y Diners

Llega en 15 a 25 días hábiles
con envío
Tienes garantía de entrega