Discrete Mathematics: Introduction to Mathematical Reasoning
Susanna Epp's DISCRETE MATHEMATICS: AN INTRODUCTION TO MATHEMATICAL REASONING, provides the same clear introduction to discrete mathematics and mathematical reasoning as her highly acclaimed DISCRETE MATHEMATICS WITH APPLICATIONS, but in a compact form that focuses on core topics and omits certain applications usually taught in other courses. The book is appropriate for use in a discrete mathematics course that emphasizes essential topics or in a mathematics major or minor course that serves as a transition to abstract mathematical thinking. The ideas of discrete mathematics underlie and are essential to the science and technology of the computer age. This book offers a synergistic union of the major themes of discrete mathematics together with the reasoning that underlies mathematical thought. 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.
Important Notice: Media content referenced within the product description or the product text may not be available in the ebook version.
What people are saying - Write a review
The Logic of Compound Statements
The Logic of Quantified Statements
Elementary Number Theory and Methods of Proof
Sequences Mathematical Induction and Recursion
Other editions - View all
2011 Cengage Learning algebra arbitrarily chosen arrow diagram binary tree co-domain conclusion conditional statement contain contrapositive copied Copyright 2011 Cengage countable defined deﬁnition denoted digits disk divides divisible domain Due to electronic duplicated eBook and/or eChapter(s electronic rights equal equation equivalence classes Euler circuit Example exercise factor false finite formula function f given graph greatest common divisor Hence Hint inductive hypothesis inductive step inverse irrational number least logically equivalent mathematical induction modus tollens multiplication negation nonnegative integer nonzero notation number of elements obtained odd integers ordered pairs particular but arbitrarily pigeonhole principle positive integer positive real number premises prime number prove rational numbers recurrence relation reflexive Rights Reserved scanned Section sentence sequence shown Solution square statement is true subsets Suppose suppressed symbol third party content total number truth table truth values variables vertex whole Write