Discrete Mathematics: Introduction to Mathematical Reasoning / Edition 1 available in Hardcover
Susanna Epp's DISCRETE MATHEMATICS: AN INTRODUCTION TO MATHEMATICAL REASONING provides a clear introduction to discrete mathematics and mathematical reasoning in a compact form that focuses on core topics. Renowned for her lucid, accessible prose, Epp explains complex, abstract concepts with clarity and precision, helping students develop the ability to think abstractly as they study each topic. In doing so, the book provides students with a strong foundation both for computer science and for other upper-level mathematics courses.
|Edition description:||New Edition|
|Product dimensions:||8.10(w) x 10.10(h) x 1.10(d)|
About the Author
Susanna S. Epp received her Ph.D. in 1968 from the University of Chicago, taught briefly at Boston University and the University of Illinois at Chicago, and is currently Vincent DePaul Professor Emerita of Mathematical Sciences at DePaul University. After initial research in commutative algebra, she became interested in cognitive issues associated with teaching analytical thinking and proof and published a number of articles related to this topic, one of which was chosen for inclusion in The Best Writing on Mathematics 2012. She has spoken widely on discrete mathematics and organized sessions at national meetings on discrete mathematics instruction. In addition to Discrete Mathematics with Applications and Discrete Mathematics: An Introduction to Mathematical Reasoning, she is co-author of Precalculus and Discrete Mathematics, which was developed as part of the University of Chicago School Mathematics Project. The third edition of Discrete Mathematics with Applications received a Texty Award for Textbook Excellence in June 2005. Epp co-organized an international symposium on teaching logical reasoning, sponsored by the Institute for Discrete Mathematics and Theoretical Computer Science (DIMACS), and she was an associate editor of Mathematics Magazine from 1991 to 2001. Long active in the Mathematical Association of America (MAA), she is a co-author of the curricular guidelines for undergraduate mathematics programs: CUPM Curriculum Guide 2004. She received the Hay Award for Contributions to Mathematics Education in 2005 and the Award for Distinguished Teaching given by the Illinois Section of the MAA in 2010.
Table of Contents
1. SPEAKING MATHEMATICALLY. Variables. The Language of Sets. The Language of Relations and Functions. 2. THE LOGIC OF COMPOUND STATEMENTS. Logical Form and Logical Equivalence. Conditional Statements. Valid and Invalid Arguments. 3. THE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements II. Statements with Multiple Quantifiers. Arguments with Quantified Statements. 4. ELEMENTARY NUMBER THEORY AND METHODS OF PROOF. Direct Proof and Counterexample I: Introduction. Direct Proof and Counterexample II: Rational Numbers. Direct Proof and Counterexample III: Divisibility. Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem. Indirect Argument: Contradiction and Contraposition. Indirect Argument: Two Classical Theorems. 5. SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION. Sequences. Mathematical Induction I. Mathematical Induction II. Strong Mathematical Induction and the Well-Ordering Principle. Defining Sequences Recursively. Solving Recurrence Relations by Iteration. 6. SET THEORY. Set Theory: Definitions and the Element Method of Proof. Set Identities. Disproofs and Algebraic Proofs. Boolean Algebras and Russell's Paradox. 7. PROPERTIES OF FUNCTIONS. Functions Defined on General Sets. One-to-one, Onto, and Inverse Functions. Composition of Functions. Cardinality and Sizes of Infinity. 8. PROPERTIES OF RELATIONS. Relations on Sets. Reflexivity, Symmetry, and Transitivity. Equivalence Relations. Modular Arithmetic and Zn. The Euclidean Algorithm and Applications. 9. COUNTING. Counting and Probability. The Multiplication Rule. Counting Elements of Disjoint Sets: The Addition Rule. The Pigeonhole Principle. Counting Subsets of a Set: Combinations. Pascal's Formula and the Binomial Theorem. 10. GRAPHS AND TREES. Graphs: An Introduction. Trails, Paths, and Circuits. Matrix Representations of Graphs. Isomorphisms of Graphs. Trees: Examples and Basic Properties. Rooted Trees.