Da: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
EUR 56,92
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 2.2.
Da: Majestic Books, Hounslow, Regno Unito
EUR 61,57
Convertire valutaQuantità: 3 disponibili
Aggiungi al carrelloCondizione: New.
Da: Books Puddle, New York, NY, U.S.A.
EUR 69,33
Convertire valutaQuantità: 3 disponibili
Aggiungi al carrelloCondizione: New.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 71,46
Convertire valutaQuantità: 3 disponibili
Aggiungi al carrelloCondizione: New.
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 67,67
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days. 830.
Da: Revaluation Books, Exeter, Regno Unito
EUR 163,83
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 2nd edition. 430 pages. 10.25x7.00x1.00 inches. In Stock.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 154,61
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Emphasizes a Problem Solving ApproachA 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 EditionThis 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.