Discrete Mathematics
4.5 (790 ratings)
4,439 students enrolled

# Discrete Mathematics

Master Discrete Math, the backbone of Mathematics and Computer Science
Bestseller
4.5 (790 ratings)
4,439 students enrolled
Created by Miran Fattah
Last updated 7/2020
English
English [Auto]
Current price: \$125.99 Original price: \$179.99 Discount: 30% off
5 hours left at this price!
30-Day Money-Back Guarantee
This course includes
• 18 hours on-demand video
• Access on mobile and TV
• Certificate of Completion
Training 5 or more people?

What you'll learn
• Learn the language of Mathematics and Mathematical symbols helping you through your Mathematical Journey.
• Construct, read and prove Mathematical statements using a variety of methods.
• Learn the fundamental topics in Logic, how to construct truth tables and tell the falsehood and truthfulness of a compound statements.
• Understand Boolean Expressions, black boxes, logical gates, digital circuits and many related topics
• Master fundamentals of Set Theory, equivalence relations and equivalence classes.
• Understand Fundamental Theorem of Arithmetics, Modular Arithmetic, and how to find GCD & LCM
• Learn how to find incidence and adjacency matrices, and identify walks trails, paths and circuits.
• Learn essential concepts in Statistics and Combinatorics.
Requirements
• Know basic operations like addition and multiplication.
Description

Discrete Mathematics (DM), or Discrete Math is the backbone of Mathematics and Computer Science. DM is the study of topics that are discrete rather than continues, for that, the course is a MUST for any Math or SC student. The topics that are covered in this course are the most essential ones, those that will touch every Math and Science student at some point of their education. Discrete Mathematics gives students the ability to understand Math language and based on that, the course is divided into 8 sections. The sections are:

1. Sets

2. Logic

3. Number Theory

4. Proofs

5. Functions

6. Relations

7. Graph Theory

8. Statistics

9. and Combinatorics

How is it delivered?

I know visually seeing a problem getting solved is the easiest and the most direct way for a student to learn so I designed the course keeping this in mind. The materials are delivered mostly through videos to make complex subject easy to comprehend. More details on certain lessons are delivered through text files to provide more explanation or examples. The course is taught in plain English, away from cloudy, complicated mathematical jargons and that is to help the student learn the material rather than getting stuck with fancy words.

How do I learn better?

There are quizzes after each section so you can test your knowledge and see how much of the material has sank in. I suggest you go through each lesson several times to better understand the content.

Who this course is for:
• This course is designed for Math and Computer Science majors or anyone interested in learning what makes the backbones of Mathematics and Computer Science.
Course content
Expand all 118 lectures 17:48:54
+ Sets
19 lectures 02:40:42
Preview 00:19
Preview 08:41
Quiz
3 questions
Number Sets
10:07
Quiz
3 questions
Set Equality
09:16
Quiz
3 questions
Set-Builder Notation
09:56
Quiz
3 questions
Types of Sets
11:49
Quiz
3 questions
Subsets
10:27
Quiz
3 questions
Power Set
05:06
Quiz
3 questions
Ordered Pairs
04:59
Quiz
3 questions
Cartesian Products
14:08
Quiz
3 questions
Cartesian Plane
03:38
Quiz
3 questions
Preview 03:14
Quiz
3 questions
Set Operations (Union, Intersection)
14:35
Quiz
3 questions
Properties of Union and Intersection
10:16
Quiz
3 questions
Set Operations (Difference, Complement)
11:57
Quiz
3 questions
Properties of Difference and Complement
07:29
Quiz
3 questions
De Morgan’s Law
08:17
Quiz
3 questions
Partition of Sets
15:49
Quiz
3 questions
Extra Practice Problems
00:39
+ Logic
23 lectures 03:22:00
Introduction
00:22
Statements
07:13
Quiz
3 questions
Preview 13:10
Quiz
3 questions
Truth Tables
09:20
Quiz
3 questions
Examples
13:03
Quiz
3 questions
Logical Equivalences
06:39
Quiz
3 questions
06:15
Quiz
3 questions
De Morgan’s Laws in Logic
11:34
Quiz
3 questions
Logical Equivalence Laws
03:23
Quiz
3 questions
Conditional Statements
12:58
Quiz
3 questions
Negation of Conditional Statements
09:31
Quiz
3 questions
Converse and Inverse
07:25
Quiz
3 questions
Biconditional Statements
08:46
Examples
11:50
Digital Logic Circuits
12:54
Black Boxes and Gates
15:18
Boolean Expressions
06:23
Quiz
4 questions
Truth Tables and Circuits
09:24
Equivalent Circuits
06:37
NAND and NOR Gates
07:12
Quiz
4 questions
Quantified Statements - ALL
07:36
Quantified Statements - THERE EXISTS
06:39
Negations of Quantified Statements
08:28
Quiz
6 questions
+ Number Theory
6 lectures 58:02
Introduction
00:35
Parity
12:43
Quiz
3 questions
Divisibility
10:45
Quiz
3 questions
Prime Numbers
08:03
Quiz
3 questions
Prime Factorization
08:33
Quiz
3 questions
GCD & LCM
17:23
Section 4 Quiz
3 questions
+ Proofs
9 lectures 01:50:43
Intro
05:40
Terminologies
07:37
Direct Proofs
08:45
Quiz
2 questions
Proofs by Contrapositive
11:25
17:16
Exhaustion Proofs
13:36
Existence & Uniqueness Proofs
15:57
Proofs by Induction
11:41
Examples
18:46
+ Functions
10 lectures 01:34:55
Intro
00:24
Functions
15:05
Evaluating a Function
12:29
Domains
15:56
Range
05:29
Function Composition
09:43
Function Combination
09:00
Even and Odd Functions
08:19
One to One Functions
08:19
Inverse Functions
10:11
Section 6 Quiz
4 questions
+ Relations
9 lectures 01:11:19
Intro
00:25
The Language of Relations
10:27
Relations on Sets
12:44
The Inverse of a Relation
06:05
Quiz
5 questions
Reflexivity, Symmetry and Transitivity
13:07
Examples
07:31
Properties of Equality & Less Than
07:48
Equivalence Relation
06:42
Equivalence Class
06:30
Section 7 Quiz
6 questions
+ Graph Theory
18 lectures 03:26:17
Intro
00:28
Graphs
11:25
Quiz
3 questions
Subgraphs
08:32
Quiz
3 questions
Degree
09:52
Quiz
3 questions
Sum of Degrees of Vertices Theorem
23:22
Quiz
3 questions
09:15
Quiz
3 questions
16:16
Quiz
3 questions
Incidence Matrix
08:04
Quiz
3 questions
Isomorphism
08:23
Quiz
3 questions
Walks, Trails, Paths, and Circuits
12:41
Quiz
3 questions
Examples
10:18
Quiz
3 questions
06:47
Quiz
3 questions
Connectedness
20:03
Quiz
3 questions
Euler Trails and Circuits
17:44
Quiz
3 questions
Fleury’s Algorithm
10:15
Quiz
3 questions
Hamiltonian Paths and Circuits
05:46
Quiz
3 questions
Ore's Theorem
14:08
Quiz
3 questions
The Shortest Path Problem
12:58
Quiz
3 questions
+ Statistics
9 lectures 39:06
Intro
00:19
Terminologies
03:05
Mean
03:31
Median
03:11
Mode
03:02
Range
08:01
Quiz
7 questions
Outlier
04:18
Variance
09:25
Standard Deviation
04:14
Chapter Quiz
8 questions
+ Combinatorics
7 lectures 01:04:01
Intro
03:29
Factorials
07:46
Quiz
3 questions
The Fundamental Counting Principle
13:25
Quiz
3 questions
Permutations
12:50
Quiz
3 questions
Combinations
12:01
Quiz
3 questions
Pigeonhole Principle
06:10
Quiz
3 questions

http://mathforum.org/dr.cgi/pascal.cgi?

The above website is a Pascal's Triangle generator. All you have to do is to indicate how many rows you want and it will generate the corresponding Pascal's Triangle.

Pascal's Triangle
08:20
Quiz
3 questions
+ Sequence and Series
8 lectures 01:01:49
Intro
00:19
Sequence
06:29
Arithmetic Sequences
12:19
Geometric Sequences
08:57
Partial Sums of Arithmetic Sequences
11:56
Partial Sums of Geometric Sequences
06:31
Series
12:32
Bonus Lecture
02:46