
Introduction to Proof Through Number Theory
Bennett Chow(Author)
American Mathematical Society (Publisher)
Published on 31. May 2023
Book
Paperback/Softback
442 pages
978-1-4704-7027-2 (ISBN)
Description
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.
More details
Series
Language
English
Place of publication
Providence
United States
Target group
Professional and scholarly
Dimensions
Height: 254 mm
Width: 178 mm
Weight
304 gr
ISBN-13
978-1-4704-7027-2 (9781470470272)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Person
Bennett Chow, University of California, San Diego, La Jolla, CA.
Content
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
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