Discrete Mathematics Introduction to Mathematical Reasoning
by Epp, Susanna S.Edition: 1st
Format: Hardcover
Pub. Date: 2011-02-07
Publisher(s): Cengage Learning
Other versions by this Author
-
This Item Qualifies for Free Shipping!*
*Excludes marketplace orders.
-
We Buy This Book Back!
List Price: $179.95
Buy New
In Stock
$179.05
Buy Used
In Stock
$134.96
Rent Textbook
Select for Price
Rent Digital
$59.99
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Summary
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.
Table of Contents
| 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 | |
| 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. |
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.