Handbook of Mathematical Induction: Theory and Applications (Discrete Mathematics and Its Applications)

Gunderson, David S.

ISBN 10: 1420093649 / ISBN 13: 9781420093643

Published by Chapman and Hall/CRC, 2010

About this Item

Hardback. No dust jacket. Cover edges and corners in good shape. Spine is tight. Pages are clean, no markings, notes or stains. Ships from Friends bookstore to benefit Beaverton (Oregon) library.

Seller Inventory # mon0000064491

Bibliographic Details

• Title: Handbook of Mathematical Induction: Theory and Applications (Discrete Mathematics and Its Applications)
• Publisher: Chapman and Hall/CRC
• Publication Date: 2010
• Language: English
• ISBN 10: 1420093649
• ISBN 13: 9781420093643
• Binding: hardcover
• Condition: Good

About this title

Synopsis

Handbook of Mathematical Induction: Theory and Applications shows how to find and write proofs via mathematical induction. This comprehensive book covers the theory, the structure of the written proof, all standard exercises, and hundreds of application examples from nearly every area of mathematics.

In the first part of the book, the author discusses different inductive techniques, including well-ordered sets, basic mathematical induction, strong induction, double induction, infinite descent, downward induction, and several variants. He then introduces ordinals and cardinals, transfinite induction, the axiom of choice, Zorn’s lemma, empirical induction, and fallacies and induction. He also explains how to write inductive proofs.

The next part contains more than 750 exercises that highlight the levels of difficulty of an inductive proof, the variety of inductive techniques available, and the scope of results provable by mathematical induction. Each self-contained chapter in this section includes the necessary definitions, theory, and notation and covers a range of theorems and problems, from fundamental to very specialized.

The final part presents either solutions or hints to the exercises. Slightly longer than what is found in most texts, these solutions provide complete details for every step of the problem-solving process.

About the Author

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.