Contact us on (02) 8445 2300
For all customer service and order enquiries

Woodslane Online Catalogues

9781470470272 Academic Inspection Copy

Introduction to Proof Through Number Theory

  • ISBN-13: 9781470470272
  • Publisher: AMERICAN MATHEMATICAL SOCIETY
    Imprint: AMERICAN MATHEMATICAL SOCIETY
  • By Bennett Chow
  • Price: AUD $229.00
  • Stock: 0 in stock
  • Availability: This book is temporarily out of stock, order will be despatched as soon as fresh stock is received.
  • Local release date: 29/08/2023
  • Format: Undefined (254.00mm X 178.00mm) 442 pages Weight: 304g
  • Categories: Mathematical logic [PBCD]
Description
Author
Biography
Table of
Contents
Google
Preview
Lighten 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.
Bennett Chow, University of California, San Diego, La Jolla, CA.
Evens, odds, and primes: A taste of number theory Mathematical induction Logic: Implications, contrapositives, contradictions, and quantifiers The Euclidean algorithm and its consequences Sets and functions Modular arithmetic Counting finite sets Congruence class arithmetic, groups, and fields Bibliography Index
Google Preview content