Discrete Mathematics : Introduction to Mathematical Reasoning
ISBN: 9780495826170 | 0495826170
Edition: 1stFormat: Hardcover
Publisher: Cengage Learning
Pub. Date: 2/7/2011
Why Rent from Knetbooks?
Because Knetbooks knows college students. Our rental program is designed to save you time and money. Whether you need a textbook for a semester, quarter or even a summer session, we have an option for you. Simply select a rental period, enter your information and your book will be on its way!
Top 5 reasons to order all your textbooks from Knetbooks:
- We have the lowest prices on thousands of popular textbooks
- Free shipping both ways on ALL orders
- Most orders ship within 48 hours
- Need your book longer than expected? Extending your rental is simple
- Our customer support team is always here to help
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.
| Speaking Mathematically | |
| Variables | |
| The Language of Sets | |
| The Language of Relations and Functions | |
| The Logic of Compound Statements | |
| Logical Form and Logical Equivalence | |
| Conditional Statements | |
| Valid and Invalid Arguments | |
| The Logic of Quantified Statements | |
| Predicates and Quantified Statements I | ... MORE |
| Predicates and Quantified Statements II | |
| Statements with Multiple Quantifiers | |
| Arguments with Quantified Statements | |
| 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 | |
| Sequences, Mathematical Induction, and Recursion | |
| Sequences | |
| Mathematical Induction I | |
| MathematicalInduction II | |
| Strong Mathematical Induction and the Well-Ordering Principle | |
| Defining Sequences Recursively | |
| Solving Recurrence Relations by Iteration | |
| Set Theory | |
| Set Theory: Definitions and the Element Method of Proof | |
| Set Identities | |
| Disproofs and Algebraic Proofs | |
| Boolean Algebras and Russell's Paradox | |
| Properties of Functions | |
| Functions Defined on General Sets | |
| One-to-one, Onto, and Inverse Functions | |
| Composition of Functions | |
| Cardinality and Sizes of Infinity | |
| Properties of Relations | |
| Relations on Sets | |
| Reflexivity, Symmetry, and Transitivity | |
| Equivalence Relations | |
| Modular Arithmetic and Zn | |
| The Euclidean Algorithm and Applications | |
| 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 | |
| Graphs and Trees | |
| Graphs: An Introduction | |
| Trails, Paths, and Circuits | |
| Matrix Representations of Graphs | |
| Isomorphisms of Graphs | |
| Trees: Examples and Basic Properties | |
| Rooted Trees | |
| Table of Contents provided by Publisher. All Rights Reserved. |
Related Products
Discrete Mathematics: Introduc...
Student Solutions Manual and S...
Please wait while this item is added to your cart...
