Picture 1 of 1
Stock photo
Picture 1 of 1
Stock photo
Discrete Mathematics with Applications by Susanna S. Epp (2003, Hardcover)
B
Brenham Book Company (406)
93.6% positive feedback
Price:
US $44.99
ApproximatelyAU $69.96
+ $40.43 postage
Returns:
30-day returns. Buyer pays for return postage. If you use an eBay postage label, it will be deducted from your refund amount. Policy depends on postage service.
Condition:
Renowned for her lucid, accessible prose, Epp explains complex, abstract concepts with clarity and precision. Students develop the ability to think abstractly as they study the ideas of logic and proof.
- Buy It NowDiscrete Mathematics with Applications
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherBrooks/Cole
ISBN-100534359450
ISBN-139780534359454
eBay Product ID (ePID)710098
Product Key Features
Number of Pages928 Pages
LanguageEnglish
Publication NameDiscrete Mathematics with Applications
Publication Year2003
SubjectGeneral, Calculus, Discrete Mathematics
TypeTextbook
Subject AreaMathematics
AuthorSusanna S. Epp
FormatHardcover
Dimensions
Item Height1.2 in
Item Weight57.7 Oz
Item Length10.2 in
Item Width8.2 in
Additional Product Features
Edition Number3
Intended AudienceCollege Audience
LCCN2003-107333
Dewey Edition22
IllustratedYes
Dewey Decimal510
Table Of Content1. THE LOGIC OF COMPOUND STATEMENTS.Logical Form and Logical Equivalence. Conditional Statements. Valid and Invalid Arguments. Application: Digital Logic Circuits. Application: Number Systems and Circuits for Addition.2. THE LOGIC OF QUANTIFIED STATEMENTS.Introduction to Predicates and Quantified Statements I. Introduction to Predicates and Quantified Statements II. Statements Containing Multiple Quantifiers. Arguments with Quantified Statements.3. 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. Direct Proof and Counterexample V: Floor and Ceiling. Indirect Argument: Contradiction and Contraposition. Two Classical Theorems. Application: Algorithms.4. SEQUENCES AND MATHEMATICAL INDUCTION.Sequences. Mathematical Induction I. Mathematical Induction II. Strong Mathematical Induction and the Well-Ordering Principle. Application: Correctness of Algorithms.5. SET THEORY.Basic Definitions of Set Theory. Properties of Sets. Disproofs, Algebraic Proofs, and Boolean Algebras. Russell''''s Paradox and the Halting Problem.6. COUNTING AND PROBABILITY.Introduction. Possibility Trees and the Multiplication Rule. Counting Elements of Disjoint Sets: The Addition Rule. Counting Subsets of a Set: Combinations. R-Combinations with Repetition Allowed. The Algebra of Combinations. The Binomial Theorem. Probability Axioms and Expected Value. Conditional Probability, Bayes'''' Formula, and Independent Events.7. FUNCTIONS.Functions Defined on General Sets. One-to-One and Onto, Inverse Functions. Application: The Pigeonhole Principle. Composition of Functions. Cardinality with Applications to Computability.8. RECURSION.Recursively Defined Sequences. Solving Recurrence Relations by Iteration. Second-Order Linear Homogeneous Recurrence Relations with Constant Coefficients. General Recursive Definitions.9. THE EFFICIENCY OF ALGORITHMS.Real-Valued Functions of a Real Variable and Their Graphs. O-, Omega-, and Theta-Notations. Application: Efficiency of Algorithms I. Exponential and Logarithmic Functions: Graphs and Orders. Application: Efficiency of Algorithms II.10. RELATIONS.Relations on Sets. Reflexivity, Symmetry, and Transitivity. Equivalence Relations. Modular Arithmetic with Applications to Cryptography. Partial Order Relations.11. GRAPHS AND TREES.Graphs: An Introduction. Paths and Circuits. Matrix Representations of Graphs. Isomorphisms of Graphs. Trees. Spanning Trees.12. FINITE STATE AUTOMATA AND APPLICATIONS.Finite-State Automata. Application: Regular Expressions. Finite-State Automata. Simplifying Finite-State Automata. Appendices.Properties of the Real Numbers. Solutions and Hints to Selected Exercises.
SynopsisSusanna Epp's DISCRETE MATHEMATICS, THIRD EDITION provides a clear introduction to discrete mathematics. Renowned for her lucid, accessible prose, Epp explains complex, abstract concepts with clarity and precision. This book presents not only the major themes of discrete mathematics, but also the reasoning that underlies mathematical thought. Students develop the ability to think abstractly as they study the ideas of logic and proof. While learning about such concepts as logic circuits and computer addition, algorithm analysis, recursive thinking, computability, automata, cryptography, and combinatorics, students discover that the ideas of discrete mathematics underlie and are essential to the science and technology of the computer age. Overall, Epp's emphasis on reasoning provides students with a strong foundation for computer science and upper-level mathematics courses.
LC Classification NumberQA39.3.E65 2004
All listings for this product
Ratings and reviews
Most relevant reviews
- 13 Dec, 2024
Excellent book for beginners
Great value for the price Has some student markings but that is to be expectedVerified purchase: YesCondition: Pre-owned
- 06 Oct, 2021
Great book.
Very well planned out and doesn't assume prior knowledge of topics.Verified purchase: YesCondition: Pre-owned
