Written to accompany a one- or two-semester course, this text combines rigor and wit to cover a plethora of topics from integers to uncountable sets. It teaches methods such as axiom, theorem, and proof through the mathematics rather than in abstract isolation.

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. Some of the proofs are presented in detail, while others (some with hints) may be assigned to the student or presented by the instructor. The authors recommend that the two parts of the book -- Discrete and Continuous -- be given equal attention. 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.

Presents fundamental mathematics, integers and real numbers, in a way that asks for student participation, while teaching how mathematics is done Provides students with methods and ideas they can use in future courses Primarily for: undergraduates who have studied calculus or linear algebra; mathematics teachers and teachers-in-training; scientists and social scientists who want to strengthen their command of mathematical methods Extra topics in appendices give instructor flexibility Includes supplementary material: sn.pub/extras Request lecturer material: sn.pub/lecturer-material

Autorentext

Matthias Beck received his initial training in mathematics in Würzburg, Germany, received his Ph.D. in mathematics from Temple University, and is now associate professor of mathematics at San Francisco State University. He is the recipient of the 2013 MAA Haimo Award for Distinguished College or University Teaching of Mathematics. He is the author of a previously published Springer book, Computing the Continuous Discretely (with Sinai Robins).

Ross Geoghegan received his initial training in mathematics in Dublin, Ireland, received his Ph.D. in mathematics from Cornell University, and is now professor of mathematics at the State University of New York at Binghamton. He is the author of a previously published Springer book, Topological Methods in Group Theory.

Zusammenfassung
The topics covered include: integers, induction, algorithms, real numbers, rational numbers, modular arithmetic, limits, and uncountable sets. Some of the proofs are presented in detail, while others (some with hints) may be assigned to the student or presented by the instructor.

Inhalt
The Discrete.- Integers.- Natural Numbers and Induction.- Some Points of Logic.- Recursion.- Underlying Notions in Set Theory.- Equivalence Relations and Modular Arithmetic.- Arithmetic in Base Ten.- The Continuous.- Real Numbers.- Embedding Z in R.- Limits and Other Consequences of Completeness.- Rational and Irrational Numbers.- Decimal Expansions.- Cardinality.- Final Remarks.- Further Topics.- Continuity and Uniform Continuity.- Public-Key Cryptography.- Complex Numbers.- Groups and Graphs.- Generating Functions.- Cardinal Number and Ordinal Number.- Remarks on Euclidean Geometry.