Loading...

Handbook of mathematical induction : theory and applications /

"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 mathe...

Full description

Bibliographic Details
Main Author: Gunderson, David S.
Format: Printed Book
Language:English
Published: Boca Raton, FL : CRC Press, c2011.
Series:CRC Press series on discrete mathematics and its applications.
Subjects:
LEADER 03167cam a2200313 a 4500
008 100730s2011 flua b 001 0 eng
010 |a  2010029756 
020 |a 9781420093643 (hardcover : alk. paper) 
020 |a 1420093649 (hardcover : alk. paper) 
035 |a (OCoLC)ocn652443768 
082 0 0 |a 511.36  |2 22 
100 1 |a Gunderson, David S. 
245 1 0 |a Handbook of mathematical induction :  |b theory and applications /  |c David S. Gunderson. 
260 |a Boca Raton, FL :  |b CRC Press,  |c c2011. 
300 |a xxv, 893 p. :  |b ill. ;  |c 27 cm. 
490 1 |a Discrete mathematics and its applications 
650 0 |a Proof theory. 
650 0 |a Induction (Mathematics) 
650 0 |a Logic, Symbolic and mathematical. 
650 0 |a Probabilities. 
942 |c REF 
504 |a Includes bibliographical references and indexes. 
505 0 |a What is mathematical induction? -- Foundations -- Variants of finite mathematical induction -- Inductive techniques applied to the infinite -- Paradoxes and sophisms from induction -- Empirical induction -- How to prove by induction -- The written MI proof -- Identities -- Inequalities -- Number theory -- Sequences -- Sets -- Logic and language -- Graphs -- Recursion and algorithms -- Games and recreations -- Relations and functions -- Linear and abstract algebra -- Geometry -- Ramsey theory -- Probability and statistics. 
520 |a "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."--Publisher's description. 
830 0 |a CRC Press series on discrete mathematics and its applications. 
906 |a 7  |b cbc  |c orignew  |d 1  |e ecip  |f 20  |g y-gencatlg 
955 |b xh00 2010-07-30  |i xh07 2010-07-30 to Dewey  |a xe04 2011-03-25 1 copy rec'd., to CIP ver. 
999 |c 96625  |d 96625 
952 |0 0  |1 0  |4 0  |6 511_360000000000000_GUN_F  |7 0  |9 96346  |a UL  |b UL  |c REF  |d 2011-12-06  |g 0.00  |l 0  |o 511.36 GUN/F  |p 86840  |r 2012-10-28  |v 5739.18  |x 32  |y REF  |k p. 69.99