Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
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
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.
Content Level »Lower undergraduate
Keywords »Cardinal number - Countable set - algebra - cardinality - completeness of R - high-order recursions - integers modulo n - noncomputable numbers - set theory - strong induction - universal quantifiers - well ordering principle
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.