000 | a | ||
---|---|---|---|
999 |
_c32223 _d32223 |
||
008 | 231006b xxu||||| |||| 00| 0 eng d | ||
020 | _a9781470470272 | ||
082 |
_a511.36 _bCHO |
||
100 | _aChow, Bennett | ||
245 | _aIntroduction to proof through number theory | ||
260 |
_bAmerican Mathematical Society, _c2023 _aProvidence : |
||
300 |
_axviii, 442 p. ; _bill., (some col.), _c26 cm |
||
365 |
_b89.00 _cUSD _d86.10 |
||
490 |
_aPure and applied undergraduate texts, 1943-9334 ; _vv.61 |
||
504 | _aIncludes bibliographical references and index. | ||
520 | _aLighten up about mathematics! Have fun. If you read this book, you will have to endure bad math puns and jokes and out-of-date pop culture references. You'll learn some really cool mathematics to boot. In the process, you will immerse yourself in living, thinking, and breathing logical reasoning. We like to call this proofs, which to some is a bogey word, but to us it is a boogie word. You will learn how to solve problems, real and imagined. After all, math is a game where, although the rules are pretty much set, we are left to our imaginations to create. Think of this book as blueprints, but you are the architect of what structures you want to build. Make sure you lay a good foundation, for otherwise your buildings might fall down. To help you through this, we guide you to think and plan carefully. Our playground consists of basic math, with a loving emphasis on number theory. We will encounter the known and the unknown. Ancient and modern inquirers left us with elementary-sounding mathematical puzzles that are unsolved to this day. You will learn induction, logic, set theory, arithmetic, and algebra, and you may one day solve one of these puzzles. | ||
650 | _aNumber theory | ||
650 | _aProof theory | ||
650 | _aMersenne conjectures | ||
650 | _aFibonacci numbers | ||
650 | _aRigor | ||
650 | _aLogic puzzles | ||
650 | _aDivision theorem | ||
650 | _aCartesian products | ||
650 | _aFun congruence facts | ||
650 | _aFermat's Little theorem | ||
650 | _aBinomial theorem | ||
650 | _aCounting problem | ||
650 | _aLaw of quadratic reciproty | ||
942 |
_2ddc _cBK |