| 000 | 02603nam a2200361 a 4500 | ||
|---|---|---|---|
| 005 | 20250918145558.0 | ||
| 008 | 111115s2011 flua b 001 0 eng | ||
| 020 |
_a9781420093643 (hbk.) _cRM340.15 |
||
| 020 | _a1420093649 (hbk.) | ||
| 039 | 9 |
_a201112140947 _bzabidah _y11-15-2011 _zfarid |
|
| 040 | _aUKM | ||
| 090 | _aQA9.54.G866 | ||
| 090 |
_aQA9.54 _b.G866 |
||
| 100 | 1 | _aGunderson, David S. | |
| 245 | 1 | 0 |
_aHandbook of mathematical induction : _btheory and applications / _cDavid S. Gunderson. |
| 260 |
_aBoca Raton, FL : _bCRC Press, _c2011. |
||
| 300 |
_axxv, 893 p. : _bill. ; _c27 cm. |
||
| 490 | 1 | _aDiscrete mathematics and its applications. | |
| 504 | _aIncludes bibliographical references and indexes. | ||
| 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. | ||
| 650 | 0 | _aProof theory. | |
| 650 | 0 | _aInduction (Mathematics). | |
| 650 | 0 | _aLogic, Symbolic and mathematical. | |
| 650 | 0 | _aProbabilities. | |
| 830 | 0 | _aCRC Press series on discrete mathematics and its applications. | |
| 907 |
_a.b15194115 _b2021-05-28 _c2019-11-12 |
||
| 942 |
_c01 _n0 _kQA9.54.G866 |
||
| 914 | _avtls003482718 | ||
| 990 | _aza | ||
| 991 | _aFakulti Sains & Teknologi (FST) | ||
| 998 |
_at _b2011-02-11 _cm _da _feng _gflu _y0 _z.b15194115 |
||
| 999 |
_c503623 _d503623 |
||