The Art of Proof is designed for a one-semester or two-quarter course. A typical student will have studied calculus (perhaps also linear algebra) with reasonable success. With an artful mixture of chatty style and interesting examples, the student's previous intuitive knowledge is placed on solid intellectual ground. The topics covered include: integers, induction, algorithms, real numbers, rational numbers, modular arithmetic, limits, and uncountable sets. Methods, such as axiom, theorem and proof, are taught while discussing the mathematics rather than in abstract isolation. The book ends with short essays on further topics suitable for seminar-style presentation by small teams of students, either in class or in a mathematics club setting. These include: continuity, cryptography, groups, complex numbers, ordinal number, and generating functions.
Preface.- Notes for the Student.- Notes for Instructors.- Part I: The Discrete.- 1 Integers.- 2 Natural Numbers and Induction.- 3 Some Points of Logic.- 4 Recursion.- 5 Underlying Notions in Set Theory.- 6 Equivalence Relations and Modular Arithmetic.- 7 Arithmetic in Base Ten.- Part II: The Continuous.- 8 Real Numbers.- 9 Embedding Z in R.- 10. Limits and Other Consequences of Completeness.- 11 Rational and Irrational Numbers.- 12 Decimal Expansions.- 13 Cardinality.- 14 Final Remarks.- Further Topics.- A Continuity and Uniform Continuity.- B Public-Key Cryptography.- C Complex Numbers.- D Groups and Graphs.- E Generating Functions.- F Cardinal Number and Ordinal Number.- G Remarks on Euclidean Geometry.- List of Symbols.- Index.