000 | a | ||
---|---|---|---|
999 |
_c32681 _d32681 |
||
008 | 240214b xxu||||| |||| 00| 0 eng d | ||
020 | _a9783319162492 | ||
082 |
_a511.3 _bJOS |
||
100 | _aJoshi, Mark | ||
245 | _aProof patterns | ||
260 |
_bSpringer, _c2015 _aCham : |
||
300 |
_axiii,190 p. ; _bill., _c24 cm |
||
365 |
_b49.99 _c€ _d94.80 |
||
504 | _aIncludes bibliographical references and index. | ||
520 | _aThis innovative textbook presents a new pattern-based approach to learning proof methods in the mathematical sciences. Readers will discover techniques that allow them to learn new proofs in different areas of pure mathematics with ease. Patterns are explored in tests from various fields such as algebra, analysis, topology, and number theory. Specific topics examined include game theory, combinatorics, and Euclidean geometry, allowing for broad familiarity. The author, an experienced lecturer and researcher recognized for his innovative vision and intuitive style, illuminates a wide range of techniques and examples, from cube doubling to polygon triangulation, the infinity of prime numbers, and the fundamental theorem of algebra. Designed as a supplement for undergraduate students, this text is an essential addition to every aspiring mathematician's toolkit | ||
650 | _aCalculus & mathematical analysis | ||
650 | _aComplete induction | ||
650 | _aContinuous function | ||
650 | _aCountable sets | ||
650 | _aEquivalence relation | ||
650 | _aEuler characteristic | ||
650 | _aHighest common factor | ||
650 | _aLeast upper bound | ||
650 | _aCombinatorics & graph theory | ||
650 | _aGeometry | ||
650 | _aMathematics combinatorics | ||
650 | _aNumber theory | ||
650 | _aTopology | ||
942 |
_2ddc _cBK |