SALE

Solution Manual for Discrete Mathematics with Applications 5th Edition Susanna S. Epp

Original price was: $35.00.Current price is: $26.50.

Solution Manual for Discrete Mathematics with Applications 5th Edition Susanna S. Epp Digital Instant Download

Category:

This is completed downloadable of Solution Manual for Discrete Mathematics with Applications, 5th Edition Susanna S. Epp

 

Product Details:

  • ISBN-10 ‏ : ‎ 1337694193
  • ISBN-13 ‏ : ‎ 978-1337694193
  • Author: Susanna S. Epp

DISCRETE MATHEMATICS WITH APPLICATIONS, 5th Edition, explains complex, abstract concepts with clarity and precision and provides a strong foundation for computer science and upper-level mathematics courses of the computer age. Author Susanna Epp 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 today’s science and technology.

 

Table of Content:

  1. Chapter 1: Speaking Mathematically
  2. 1.1 Variables
  3. 1.2 The Language of Sets
  4. 1.3 The Language of Relations and Functions
  5. 1.4 The Language of Graphs
  6. Chapter 2: The Logic of Compound Statements
  7. 2.1 Logical Form and Logical Equivalence
  8. 2.2 Conditional Statements
  9. 2.3 Valid and Invalid Arguments
  10. 2.4 Application: Digital Logic Circuits
  11. 2.5 Application: Number Systems and Circuits for Addition
  12. Chapter 3: The Logic of Quantified Statements
  13. 3.1 Predicates and Quantified Statements I
  14. 3.2 Predicates and Quantified Statements II
  15. 3.3 Statements with Multiple Quantifiers
  16. 3.4 Arguments with Quantified Statements
  17. Chapter 4: Elementary Number Theory and Methods of Proof
  18. 4.1 Direct Proof and Counterexample I: Introduction
  19. 4.2 Direct Proof and Counterexample II: Writing Advice
  20. 4.3 Direct Proof and Counterexample III: Rational Numbers
  21. 4.4 Direct Proof and Counterexample IV: Divisibility
  22. 4.5 Direct Proof and Counterexample V: Division into Cases and the Quotient-Remainder Theorem
  23. 4.6 Direct Proof and Counterexample VI: Floor and Ceiling
  24. 4.7 Indirect Argument: Contradiction and Contraposition
  25. 4.8 Indirect Argument: Two Famous Theorems
  26. 4.9 Application: The Handshake Theorem
  27. 4.10 Application: Algorithms
  28. Chapter 5: Sequences, Mathematical Induction, and Recursion
  29. 5.1 Sequences
  30. 5.2 Mathematical Induction I: Proving Formulas
  31. 5.3 Mathematical Induction II: Applications
  32. 5.4 Strong Mathematical Induction and the Well-Ordering Principle for the Integers
  33. 5.5 Application: Correctness of Algorithms
  34. 5.6 Defining Sequences Recursively
  35. 5.7 Solving Recurrence Relations by Iteration
  36. 5.8 Second-Order Linear Homogeneous Recurrence Relations with Constant Coefficients
  37. 5.9 General Recursive Definitions and Structural Induction
  38. Chapter 6: Set Theory
  39. 6.1 Set Theory: Definitions and the Element Method of Proof
  40. 6.2 Properties of Sets
  41. 6.3 Disproofs and Algebraic Proofs
  42. 6.4 Boolean Algebras, Russell’s Paradox, and the Halting Problem
  43. Chapter 7: Properties of Functions
  44. 7.1 Functions Defined on General Sets
  45. 7.2 One-to-One, Onto, and Inverse Functions
  46. 7.3 Composition of Functions
  47. 7.4 Cardinality with Applications to Computability
  48. Chapter 8: Properties of Relations
  49. 8.1 Relations on Sets
  50. 8.2 Reflexivity, Symmetry, and Transitivity
  51. 8.3 Equivalence Relations
  52. 8.4 Modular Arithmetic with Applications to Cryptography
  53. 8.5 Partial Order Relations
  54. Chapter 9: Counting and Probability
  55. 9.1 Introduction to Probability
  56. 9.2 Possibility Trees and the Multiplication Rule
  57. 9.3 Counting Elements of Disjoint Sets: The Addition Rule
  58. 9.4 The Pigeonhole Principle
  59. 9.5 Counting Subsets of a Set: Combinations
  60. 9.6 r-Combinations with Repetition Allowed
  61. 9.7 Pascal’s Formula and the Binomial Theorem
  62. 9.8 Probability Axioms and Expected Value
  63. 9.9 Conditional Probability, Bayes’ Formula, and Independent Events
  64. Chapter 10: Theory of Graphs and Trees
  65. 10.1 Trails, Paths, and Circuits
  66. 10.2 Matrix Representations of Graphs
  67. 10.3 Isomorphisms of Graphs
  68. 10.4 Trees: Examples and Basic Properties
  69. 10.5 Rooted Trees
  70. 10.6 Spanning Trees and a Shortest Path Algorithm
  71. Chapter 11: Analysis of Algorithm Efficiency
  72. 11.11 Real-Valued Functions of a Real Variable and Their Graphs
  73. 11.2 Big-O, Big-Omega, and Big-Theta Notations
  74. 11.3 Application: Analysis of Algorithm Efficiency I
  75. 11.4 Exponential and Logarithmic Functions: Graphs and Orders
  76. 11.5 Application: Analysis of Algorithm Efficiency II
  77. Chapter 12: Regular Expressions and Finite-State Automata
  78. 12.1 Formal Languages and Regular Expressions
  79. 12.2 Finite-State Automata
  80. 12.3 Simplifying Finite-State Automata
  81. Appendix A: Properties of the Real Numbers
  82. Appendix B: Solutions and Hints to Selected Exercises
  83. Index

Related products