Handbook of Mathematical Induction - Gunderson, David S
287,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in über 4 Wochen
payback
144 °P sammeln
  • Gebundenes Buch

This comprehensive handbook presents hundreds of classical theorems and proofs that span many areas, including basic equalities and inequalities, combinatorics, linear algebra, calculus, trigonometry, geometry, set theory, game theory, recursion, and algorithms. It derives many forms of mathematical induction, such as infinite descent and the axiom of choice, from basic principles. Requiring only a modest amount of mathematical maturity to understand most results and proofs, the book contains more than 750 exercises-with complete solutions to at least 500. It also includes nearly 600…mehr

Andere Kunden interessierten sich auch für
Produktbeschreibung
This comprehensive handbook presents hundreds of classical theorems and proofs that span many areas, including basic equalities and inequalities, combinatorics, linear algebra, calculus, trigonometry, geometry, set theory, game theory, recursion, and algorithms. It derives many forms of mathematical induction, such as infinite descent and the axiom of choice, from basic principles. Requiring only a modest amount of mathematical maturity to understand most results and proofs, the book contains more than 750 exercises-with complete solutions to at least 500. It also includes nearly 600 bibliographic references, numerous cross references, and an extensive index of over 3,000 entries.
Autorenporträt
David S. Gunderson is a professor and chair of the Department of Mathematics at the University of Manitoba in Winnipeg, Canada. He earned his Ph.D. in pure mathematics from Emory University. His research interests include Ramsey theory, extremal graph theory, combinatorial geometry, combinatorial number theory, and lattice theory.