03096nam a2200313 a 4500 vtls000049218 KUKTEM 20251117150452.0 101213t2011 flua f b 001 0 eng d 9781420093643 (hardcover : alk. paper) 1420093649 (hardcover : alk. paper) 201107140054 VLOAD 201106101630 fauzi 201012131602 training 201012131602 training UMP QA9.54 .G86 2011 Gunderson, David S. Handbook of mathematical induction : theory and applications / David S. Gunderson Boca Raton, FL : CRC Press, c2011 xxv, 893 p. : ill. ; 27 cm. Discrete mathematics and its applications Includes bibliographical references and indexes 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 "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 Proof theory Induction (Mathematics) Logic, Symbolic and mathematical Probabilities CRC Press series on discrete mathematics and its applications 0 0 0 0 10000 10000 2019-09-04 349.25 0 QA9.54 .G86 2011 0000057583 2019-09-04 00:00:00 1 349.25 2019-09-04 OPEN VIRTUA40 58987 58993 VTLSSORT0080*0200*0201*0400*0900*1000*2450*2600*3000*4900*5040*5050*5200*6500*6501*6502*6503*8300*9991