menu
bartleby
search
close search
Hit Return to see all results

Discrete Mathematics With Applications 5th Edition

Discrete Mathematics With Applications - 5th Edition - by EPP,  Susanna S. - ISBN 9781337694193
Buy this textbookBuyarrow_forward

Discrete Mathematics With Applications
5th Edition
EPP, Susanna S.
Publisher: Cengage Learning,
ISBN: 9781337694193

Solutions for Discrete Mathematics With Applications

View Samples
Chapter
Section

Browse All Chapters of This Textbook

Show more chapters add
Chapter 3.2 - Predicates And Quantified Statements IiChapter 3.3 - Statements With Multiple QuantifiersChapter 3.4 - Arguments With Quantified StatementsChapter 4.1 - Direct Proof And Counterexample I: IntroductionChapter 4.2 - Direct Proof And Counterexample Ii: Writing AdviceChapter 4.3 - Direct Proof And Counterexample Iii: Rational NumbersChapter 4.4 - Direct Proof And Counterexample Iv: DivisibilityChapter 4.5 - Direct Proof And Counterexample V: Division Into Cases And The Quotient-remainder TheoreChapter 4.6 - Direct Proof And Counterexample Vi: Floor And CeilingChapter 4.7 - Indirect Argument: Contradiction And ContrapositionChapter 4.8 - Indirect Argument: Two Famous TheoremsChapter 4.9 - Application: The Handshake TheoremChapter 4.10 - Application: AlgorithmsChapter 5.1 - SequencesChapter 5.2 - Mathematical Induction I: Proving FormulasChapter 5.3 - Mathematical Induction Ii: ApplicationsChapter 5.4 - Strong Mathematical Induction And The Well-ordering Principle For The IntegersChapter 5.5 - Application: Correctness Of AlgorithmsChapter 5.6 - Defining Sequences RecursivelyChapter 5.7 - Solving Recurrence Relations By IterationChapter 5.8 - Second-order Linear Homogeneous Recurrence Relations With Constant CoefficientsChapter 5.9 - General Recursive Definitions And Structural InductionChapter 6.1 - Set Theory: Definitions And The Element Method Of ProofChapter 6.2 - Properties Of SetsChapter 6.3 - Disproofs And Algebraic ProofsChapter 6.4 - Boolean Algebras, Russell’s Paradox, And The Halting ProblemChapter 7.1 - Functions Defined On General SetsChapter 7.2 - One-to-one, Onto, And Inverse FunctionsChapter 7.3 - Composition Of FunctionsChapter 7.4 - Cardinality With Applications To ComputabilityChapter 8.1 - Relations On SetsChapter 8.2 - Reflexivity, Symmetry, And TransitivityChapter 8.3 - Equivalence RelationsChapter 8.4 - Modular Arithmetic With Applications To CryptographyChapter 8.5 - Partial Order RelationsChapter 9.1 - Introduction To ProbabilityChapter 9.2 - Possibility Trees And The Multiplication RuleChapter 9.3 - Counting Elements Of Disjoint Sets: The Addition RuleChapter 9.4 - The Pigeonhole PrincipleChapter 9.5 - Counting Subsets Of A Set: CombinationsChapter 9.6 - R-combinations With Repetition AllowedChapter 9.7 - Pascal’s Formula And The Binomial TheoremChapter 9.8 - Probability Axioms And Expected ValueChapter 9.9 - Conditional Probability, Bayes’ Formula, And Independent EventsChapter 10.1 - Trails, Paths, And CircuitsChapter 10.2 - Matrix Representations Of GraphsChapter 10.3 - Isomorphisms Of GraphsChapter 10.4 - Trees: Examples And Basic PropertiesChapter 10.5 - Rooted TreesChapter 10.6 - Spanning Trees And A Shortest Path AlgorithmChapter 11.1 - Real-valued Functions Of A Real Variable And Their GraphsChapter 11.2 - Big-o, Big-omega, And Big-theta NotationsChapter 11.3 - Application: Analysis Of Algorithm Efficiency IChapter 11.4 - Exponential And Logarithmic Functions: Graphs And OrdersChapter 11.5 - Application: Analysis Of Algorithm Efficiency IiChapter 12.1 - Formal Languages And Regular ExpressionsChapter 12.2 - Finite-state AutomataChapter 12.3 - Simplifying Finite-state Automata

Related Math Textbooks with Solutions

Still sussing out bartleby?
Check out a sample textbook solution.
See a sample solution