Mastering Discrete Math: Logic, Proofs, and Graphs Comprehensive Guide
Unlock the Logic: Master Discrete Math with Kimberly Brehm – From Propositions to Graphs, Equip Yourself with Essential Problem-Solving Skills!
4.1 (8)
132 learners
What you'll learn
Understand and apply logical operations and connectives in propositions.
Construct truth tables to evaluate compound statements and logical equivalences.
Translate complex logic statements into predicate logic with quantifiers.
Utilize set theory and functions in solving mathematical and real-world problems.
Construct truth tables to evaluate compound statements and logical equivalences.
Translate complex logic statements into predicate logic with quantifiers.
Utilize set theory and functions in solving mathematical and real-world problems.
This course includes
- 19 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 80 lessons • 19 hours of video
Discrete Mathematics Foundations and Applications
80 lessons • 19 hours
▶
Discrete Mathematics Foundations and Applications
80 lessons • 19 hours
- Discrete Math - 1.1.1 Propositions, Negations, Conjunctions and Disjunctions19:31
- Discrete Math - 1.1.2 Implications Converse, Inverse, Contrapositive, and Biconditionals19:05
- Discrete Math - 1.1.3 Constructing a Truth Table for Compound Propositions11:45
- Discrete Math 1.2.1 - Translating Propositional Logic Statements11:10
- Discrete Math - 1.2.2 Solving Logic Puzzles16:15
- Discrete Math - 1.2.3 Introduction to Logic Circuits07:36
- Discrete Math - 1.3.1 “Proving” Logical Equivalences with Truth Tables16:11
- Discrete Math - 1.3.2 Key Logical Equivalences Including De Morgan’s Laws06:09
- Discrete Math - 1.3.3 Constructing New Logical Equivalences14:28
- Discrete Math - 1.4.1 Predicate Logic08:01
- Discrete Math - 1.4.2 Quantifiers15:46
- Discrete Math - 1.4.3 Negating and Translating with Quantifiers19:17
- Discrete Math - 1.5.1 Nested Quantifiers and Negations18:20
- Discrete Math - 1.5.2 Translating with Nested Quantifiers22:28
- Discrete Math - 1.6.1 Rules of Inference for Propositional Logic28:34
- Discrete Math - 1.6.2 Rules of Inference for Quantified Statements17:04
- Discrete Math - 1.7.1 Direct Proof09:44
- Discrete Math - 1.7.2 Proof by Contraposition06:38
- Discrete Math - 1.7.3 Proof by Contradiction09:40
- Discrete Math - 1.8.1 Proof by Cases18:46
- Discrete Math - 1.8.2 Proofs of Existence And Uniqueness08:59
- Discrete Math - 2.1.1 Introduction to Sets12:41
- Discrete Math - 2.1.2 Set Relationships15:03
- Discrete Math - 2.2.1 Operations on Sets13:32
- Discrete Math - 2.2.2 Set Identities11:29
- Discrete Math - 2.2.3 Proving Set Identities17:48
- Discrete Math - 2.3.1 Introduction to Functions06:44
- Discrete Math - 2.3.2 One-to-One and Onto Functions10:58
- Discrete Math - 2.3.3 Inverse Functions and Composition of Functions12:02
- Discrete Math - 2.3.4 Useful Functions to Know04:51
- Discrete Math - 2.4.1 Introduction to Sequences11:45
- Discrete Math - 2.4.2 Recurrence Relations15:07
- Discrete Math - 2.4.3 Summations and Sigma Notation06:39
- Discrete Math - 2.4.4 Summation Properties and Formulas13:53
- Discrete Math - 2.6.1 Matrices and Matrix Operations20:05
- Discrete Math - 2.6.2 Matrix Operations on your TI-8405:27
- Discrete Math - 2.6.3 Zero-One Matrices08:34
- Discrete Math - 3.1.1 Introduction to Algorithms and Pseudo Code08:43
- Discrete Math - 3.1.2 Searching Algorithms10:45
- Discrete Math - 3.1.3 Sorting Algorithms11:25
- Discrete Math - 3.1.4 Optimization Algorithms07:35
- Discrete Math - 4.1.1 Divisibility17:29
- Discrete Math - 4.1.2 Modular Arithmetic22:27
- Discrete Math - 4.2.1 Decimal Expansions from Binary, Octal and Hexadecimal11:46
- Discrete Math - 4.2.2 Binary, Octal and Hexadecimal Expansions From Decimal07:44
- Discrete Math - 4.2.3 Conversions Between Binary, Octal and Hexadecimal Expansions16:11
- Discrete Math - 4.2.4 Algorithms for Integer Operations36:00
- Discrete Math - 4.3.1 Prime Numbers and Their Properties13:40
- Discrete Math - 4.3.2 Greatest Common Divisors and Least Common Multiples10:04
- Discrete Math - 4.3.3 The Euclidean Algorithm07:34
- Discrete Math - 4.3.4 Greatest Common Divisors as Linear Combinations11:53
- Discrete Math - 4.4.1 Solving Linear Congruences Using the Inverse13:50
- Discrete Math - 5.1.1 Proof Using Mathematical Induction - Summation Formulae23:24
- Discrete Math - 5.1.2 Proof Using Mathematical Induction - Inequalities09:53
- Discrete Math - 5.1.3 Proof Using Mathematical Induction - Divisibility07:40
- Discrete Math - 5.2.1 The Well-Ordering Principle and Strong Induction09:40
- Discrete Math - 5.3.1 Revisiting Recursive Definitions20:39
- Discrete Math - 5.3.2 Structural Induction11:52
- Discrete Math - 5.4.1 Recursive Algorithms10:25
- Discrete Math - 6.1.1 Counting Rules11:57
- Discrete Math - 6.3.1 Permutations and Combinations14:48
- Discrete Math - 6.3.2 Counting Rules Practice29:24
- Discrete Math - 6.4.1 The Binomial Theorem19:56
- Discrete Math - 7.1.1 An Intro to Discrete Probability11:34
- Discrete Math - 7.1.2 Discrete Probability Practice28:11
- Discrete Math - 7.2.1 Probability Theory11:27
- Discrete Math - 7.2.2 Random Variables and the Binomial Distribution13:49
- Discrete Math - 8.1.1 Modeling with Recurrence Relations25:28
- Discrete Math - 8.5.1 The Principle of Inclusion-Exclusion17:35
- Discrete Math - 9.1.1 Introduction to Relations10:28
- Discrete Math - 9.1.2 Properties of Relations21:39
- Discrete Math - 9.1.3 Combining Relations16:03
- Discrete Math - 9.3.1 Matrix Representations of Relations and Properties21:03
- Discrete Math - 9.3.2 Representing Relations Using Digraphs12:27
- Discrete Math - 9.5.1 Equivalence Relations22:29
- Discrete Math - 10.1.1 Introduction to Graphs06:18
- Discrete Math - 10.2.1 Graph Terminology13:11
- Discrete Math - 10.2.2 Special Types of Graphs11:32
- Discrete Math - 10.2.3 Applications of Graphs07:39
- Discrete Math - 11.1.1 Introduction to Trees17:18