
Define the concept of a set and explain its notation, then introduce related topics in sets as an entry to discrete mathematics.
Define a set as a collection of objects called elements. Use braces, commas, and a set name to denote the collection, and the element-of symbol to show membership.
Identify natural numbers N, integers Z, rationals Q, irrationals, real numbers, imaginary numbers I, and complex numbers C, and explain their relationships with examples like pi.
Explore set equality through the axiom of extension, showing that two sets are equal when they contain the same elements, regardless of order or repetition.
Learn how set builder notation builds sets by a common property, using such that to specify elements like blue shapes and numbers with x > 0 or x < 0.
Explore universal, empty, singleton, finite, infinite sets, and subsets, and learn about set cardinality and equivalent sets in discrete mathematics.
Define a subset as every element of A also in B, introduce subset and proper subset notation, and note that the empty set is a subset of every set.
Explore the power set, the set of all subsets of a given set, illustrated with ice cream flavor options, two-element and three-element examples, and the 2^n counting rule.
Explore ordered pairs and n-tuples, where the order of elements matters, unlike sets; learn their notation and how Cartesian products relate.
Define the Cartesian product as the set of all ordered pairs from two sets, illustrated by A cross B, and show that three or more sets yield ordered tuples.
Explore the Cartesian plane as the coordinate plane with x and y axes, define points via Cartesian product of real numbers, and extend to three dimensions.
Learn how Venn diagrams use circles to show relationships, such as A and B with B as a subset of A, and natural, integers, rational, irrational numbers inside real numbers.
Define and illustrate union and intersection of sets, using Venn diagrams and formal definitions, highlighting or versus and, and exploring practical examples with real numbers.
Explore the properties of union and intersection, including the commutative, associative, and distributive laws, and identities with the empty set, universal set, and the idempotent law.
Explore difference and complement as fundamental set operations that form new sets from A and B, using universal sets, real-number intervals, and Venn diagrams.
Explore the properties of difference and complement in set theory, including universal sets, complements, unions, and intersections, with practical examples.
Explore De Morgan's laws for sets, showing that the complement of a union equals the intersection of complements and the complement of an intersection equals the union of complements.
In discrete mathematics, learn the partition of sets by selecting non-empty, pairwise disjoint subsets whose union equals the original set.
Download the pdf document with extra practice problems and solutions to verify your steps, and practice as much as you can to solidify the topics and concepts studied.
Explore core logic topics such as statements, composite statements, conditional statements, and truth tables. Begin with the first topic in logic: statements.
Define statements as sentences that are either true or false, illustrated by 2+2=4 (true) and 2+2=5 (false); show non statements like 'Fridays are nice' and use P to represent them.
Explore compound statements by joining true or false statements with logical connectives (and, or, not) and translating English ideas into symbolic logic with P, Q, and inequalities.
Explore truth tables to determine when compound statements are true or false. Compare conjunction, inclusive and exclusive or, and negation using P and Q.
Construct truth tables for compound statements with p, q, and r, applying order of operations, negation, and parentheses; explore or, and, not, and exclusive or through practical examples.
Assess logical equivalence by constructing truth tables and comparing truth values for all substitutions, using and, not, and double negation examples.
Explore tautologies and contradictions through truth tables, using examples with P and not P to show a statement that is always true or always false.
Apply De Morgan's laws in logic to negate P and Q as not P or not Q, and negate P or Q as not P and not Q.
Explore logical equivalence laws, including commutative, associative, and distributive laws, and learn via truth tables, tautology and contradiction concepts, with practice proving these laws using a downloadable reference.
Explore conditional statements in discrete mathematics using if-then notation, hypothesis and conclusion, and truth tables. Learn that if p then q is equivalent to not p or q.
Learn how to negate conditional statements like if p then q using p and not q, and explore contrapositive with if not q then not p, including truth tables.
Explore the converse and inverse of conditional statements, contrast them with contrapositive, and learn through examples and truth tables how their logical relationships differ from the original conditional.
Explore how biconditional statements express both directions using if and only if, and examine their truth conditions with P and Q through study and pass examples.
Explore truth tables for conditional and biconditional statements in discrete mathematics, and learn logical equivalences and converting to and/or forms.
Explore how logic shapes computing by examining circuits, series and parallel switches, light bulbs as examples, the truth tables for and and or, and binary digits.
Learn how black boxes model circuits by mapping inputs to outputs, and how not gates, and gates, and or gates work. Explore a tool to build and test simple circuits.
Explore boolean expressions by combining boolean variables with not, and, or; translate circuits into expressions and back.
Turn truth tables into circuits by identifying true-output rows, forming and not expressions, and combining them with or to create a circuit using and gates, not gates, and or gates.
Explore how equivalent circuits share identical inputs and outputs, using and, or, and not gates, truth tables, and simplification.
NAND and NOR gates are negated versions of and and or gates, showing distinct truth tables and implementing not (P and Q) and not (P or Q) respectively.
Define quantified statements and the universal quantifier, expressing that all elements of a set meet a condition, with real-number examples and counterexamples that disprove universal statements.
Learn about universal and existential quantified statements, with examples showing there exists an integer n such that n^2 = n (0 or 1) and when universal claims fail.
Learn to negate universal and existential quantified statements using counterexamples and universal negations, with examples like all men wear hats and set members.
Practice end-of-section extra problems by downloading the PDF with solutions to verify your steps and solidify the concepts we've studied, and ask questions anytime.
Discover the properties of numbers, including even and odd numbers, primes, and composites, as you begin an introduction to number theory.
Explore parity in integers by defining even numbers as 2k and odd numbers as 2k+1, and learn how addition and multiplication preserve parity with concrete examples.
Explore divisibility of integers, including the formal definition n = d·k and rules for 1, 2, 3, 4, and 5, noting A|B and B|A need not be equal.
Define prime numbers as integers greater than one with only one and themselves as positive divisors. Explore the fundamental theorem of arithmetic, primes versus composites, and primality tools.
Explore prime factorization by breaking numbers into prime factors, using the smallest primes to divide until one, and learn the unique prime factorization theorem.
Learn how to compute the GCD and LCM using divisors, prime factorization, and the LCM formula, product of the numbers divided by their GCD, with examples like 6 and 10.
Download the pdf of extra practice problems with solutions to check your steps and reinforce the concepts we studied, and practice as much as possible.
Explore why proofs are essential in mathematics and how they establish truth forever. Watch a flawed proof that 2 equals 1 to illustrate how valid reasoning matters.
Explore core terminologies in discrete mathematics, including conjectures, theorems, axioms, lemmas, and corollaries, and how proofs turn conjectures into proven statements.
Direct proofs use axioms, definitions, and existing theorems to establish statements, as shown by proving the square of an odd integer is odd and that divisibility is preserved under addition.
Explore proofs by contrapositive, an indirect method where not q implies not p, leveraging logical equivalence to prove statements when direct proofs fail, with examples.
Explore proofs by contradiction, learning to assume the opposite and derive a contradiction, as shown with infinite primes and the irrationality of sqrt(2).
Explore proofs by exhaustion, or proofs by cases, which divide a statement into finite cases and prove each to establish the overall result.
Explore existence and uniqueness proofs, distinguishing constructive from nonconstructive methods with prime number examples and counterexamples. Learn how to verify existence and prove uniqueness in equations.
Explore proofs by induction in discrete mathematics, using the dominoes example to illustrate base cases, inductive steps, and the inductive hypothesis, culminating in the sum formula n(n+1)/2.
The lecture on induction demonstrates proving statements by induction, detailing base case, inductive hypothesis, and proving k+1, with multiple examples of algebraic identities and divisibility claims.
Download the extra practice problems pdf to practice the topics and concepts studied so far, use the included solutions to check your steps, and ask questions if needed.
Explore the fundamentals of functions, including evaluation, domain and range, function composition, and even and odd functions, to build a solid foundation in discrete mathematics.
Define a function as a relation that maps each input in the domain to exactly one output in the range, with concepts like domain, range, and f(x)=x^2.
Learn how to evaluate a function by substituting a value for the placeholder X, applying the rule, and understanding domain and range with independent and dependent variables.
Learn how a function's domain is the set of inputs that keep it defined, with examples like x+1 (all real numbers), 1/(1−x) (excluding 1), and 1/(x^2−x−2) (excluding 2 and −1).
Understand that the range is the set of all outputs produced by a function from its domain, as shown by x+1 and x^2 examples.
Learn how to represent a function as a graph by pairing inputs with outputs and plotting points, then connect them to visualize functions like x+1 and x^2, noting domain, range.
Explore the Dismas graphing calculator to graph functions, edit live, and explore derivatives and integrals using online and offline modes across Chrome, iOS, and Android.
Learn how to extract information from a graph by identifying x values and reading the corresponding y values, calculating f(x) for given inputs and solving for x from y.
Identify a function's domain and range from its graph by listing all X values (domain) and all Y values (range); note real-number domains and possible gaps in piecewise graphs.
Explore function composition by placing one function inside another to form a new function, using notation like F∘G and evaluating F(G(x)) or G(F(x)) with examples such as F(x)=x^2.
Explore how to combine functions by adding, subtracting, multiplying, and dividing f(x) and g(x), where f(x)=x^2 and g(x)=x+1, and evaluate at specific x through examples.
Determine if a function is even or odd by evaluating f(-x) and comparing to f(x) or -f(x). Use examples like x^2 and x^3, and note even powers don't guarantee evenness.
Study one-to-one (injective) functions by ensuring each input maps to a unique output, and apply the horizontal line test to distinguish injective from non-injective cases.
Explore onto (surjective) functions by contrasting them with injective mappings, define domain, code domain, and range, and show that a surjective function maps every code-domain element to some domain element.
Explore inverse functions and one-to-one mappings, learn how domains and ranges switch under inversion, and apply algebraic steps to find F^{-1} from examples like 3x-2 and (2x+3)/(x-1).
Master polynomial long division by using the highest-degree term, subtracting, and bringing down terms to reveal a quotient and remainder, with dividend = divisor times quotient plus remainder.
Download the attached PDF for extra practice problems on the topics studied so far, with solutions to verify your steps; practice to solidify concepts and ask questions.
Explore relations on sets, including the inverse, and analyze properties such as reflexivity, symmetry, and transitivity, leading to equivalence relations and classes.
Discover how discrete mathematics defines relations among objects, using examples with sets and numbers, including rules like X<Y and X is a factor of Y, to form related pairs.
Define relations on sets as subsets of A×B with a domain A and codomain B. See examples: a less-than rule, a real-number relation x^2+y^2=1, and a cardinality-based subset relation.
Identify the inverse of a relation by swapping the coordinates of ordered pairs from A to B, yielding the inverse relation from B to A.
Explore reflexivity, symmetry, and transitivity in relations in discrete mathematics. Analyze a set with x minus y divisible by three and identify the related ordered pairs.
Explore reflexivity, symmetry, and transitivity with concrete examples on a set and relation, evaluating reflexivity and symmetry and identifying transitivity across cases.
Explore the properties of equality and the less than relation on real numbers, showing equality is reflexive, symmetric, and transitive, while less than is not reflexive or symmetric but transitive.
Learn what an equivalence relation is by checking reflexivity, symmetry, and transitivity, with examples showing when a relation qualifies.
Discover how equivalence classes are formed by an equivalence relation R on a set A, where the class of a is the set of x in A related to a.
Download the extra practice problems pdf, practice as much as you can to solidify the concepts from discrete mathematics, use solutions to verify your steps, and ask questions.
Introduce graph theory by defining graphs and subgraphs, vertex degree, adjacency, and incidence. Explore isomorphism, and the notions of walks, trails, and paths as foundational topics.
Explore how graphs represent relationships through handshakes among five people, defining vertices and edges; a graph consists of vertex set V and an edge set E with endpoints in V.
Learn how subgraphs work: a subgraph H of G uses only vertices and edges from G, with endpoints matching and each vertex contained in G.
Determine the degree of a vertex as the number of edges with it as an endpoint, counting loops as two and isolated vertices, and form degree sequence and graph degree.
The sum of degrees of vertices theorem, or handshake theorem, asserts that the total degree equals twice the number of edges, making odd-degree vertices even in count.
Explore adjacency and incidence in graphs by examining how vertices connect via edges, how edges share a vertex, how loops affect adjacency, and how edges are incident on endpoints.
Represent graphs efficiently by building an adjacency matrix that records the number of edges between each pair of vertices, including loops, with size equal to the vertex count.
Learn to build an incidence matrix by labeling vertices on the side and edges on the top, using 1 for incidence, 0 for not incident, and 2 for loops.
Learn how isomorphism identifies graphs with the same number of vertices and edges and identical edge endpoints, even with relabeled vertices.
Explore walks in graphs, distinguish trails from paths, and learn how distance and simple circuits measure shortest routes and loop structures.
Explore walks, trails, paths, and circuits by analyzing vertex and edge sequences, distinguishing repeats, with examples, and conclude infinite walks, three paths, and nine trails from V1 to V4.
Explore how eccentricity, diameter, and radius relate to distance in graphs by computing each vertex's farthest distance and identifying central and peripheral vertices.
Explore connectedness in graphs by examining walks between vertices, components, and how removing edges or vertices creates disconnecting or separating sets, bridges, and measures like edge connectivity and vertex connectivity.
Explore how the seven bridges of Königsberg map to graphs, then use vertex degree parity to determine when Euler trails or Euler circuits exist in connected graphs.
Use Flurry's algorithm to find Euler circuits and trails by starting at a vertex, deleting edges in a replica, and avoiding any edge whose removal disconnects the graph.
Explore Hamiltonian paths and circuits, where each vertex is visited exactly once and circuits return to the start. Compare to Euler trails and the absence of an existence criterion.
Apply Ore's theorem to identify hamiltonian graphs by checking that a simple graph with at least three vertices has non-adjacent vertices whose degree sum meets or exceeds the vertex count.
Explore the shortest path problem on weighted graphs and apply Dijkstra's algorithm to find minimum total weight paths between start and end vertices, with real-world city and network examples.
Download the extra pdf with practice problems and solutions to check your work and reinforce the topics studied. Practice as much as you can to ensure the concepts settle in.
Explore fundamental statistics concepts in this introductory lecture, covering mean, median, mode, range, and outlier variants, and previewing other engaging topics.
Define statistics as the science of planning studies and drawing conclusions from data. Explain data as observations; population is all elements, and a sample is a portion.
Explain arithmetic mean as the center of a dataset by dividing the sum of values by their count, illustrated with the dataset 15, 16, 20, 22, 30.
Discover how median, a measure of center, uses sorted data; pick the middle value for odd counts or average the two middle values for even counts.
Identify the mode as the data value that occurs most often in a data set, and explore no mode, bimodal, and multimodal cases with examples.
Define range as the difference between the highest and lowest values in a data set, use ordering to find range and median, and compute mean, median, and mode.
Define an outlier as a data value outside the general pattern, and show how one outlier can distort the mean and the range.
Discover dispersion and variance as metrics of how data deviate from the mean, using sigma squared and the n-1 adjustment, with comparisons of data sets A and B.
Explain standard deviation as a measure of data dispersion, show its relationship to variance, and demonstrate calculation for population and sample using a dataset and a calculator.
Practice makes mastery in discrete mathematics with an attached PDF of extra problems and solutions; download, solve, and verify your steps to solidify concepts, and ask questions if needed.
Explore combinatorics within discrete mathematics, focusing on counting and arranging objects. Use the four-people four-box example to illustrate seating options and introduce factorial.
Define n! as the product of all positive integers up to n, with 0! = 1, and illustrate simplifications such as 16!/14! = 16×15 and (n+1)!/(n-1)! = n^2+n.
Explore the fundamental counting principle, also called the basic counting principle, using independent cases and the multiplication rule, and handling dependency with the addition principle through practical examples.
Explore how order matters in permutations, contrasting with salads where order is irrelevant, and apply repetition and non-repetition cases using factorials and the notation P(n,r).
Explore the difference between permutations and combinations, including when repetition is allowed or not, and apply the n choose r and related formulas with donuts and lottery examples.
Discover the pigeonhole principle: when more items than containers, at least one container holds multiple items. Apply it to counting, blue and green gloves, and the birthday problem.
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.
download the extra practice problems pdf and work through the exercises to reinforce the concepts studied, using the included solutions to verify your steps.
Explore the fundamentals of sequences and series, including arithmetic and geometric sequences, and learn about partial sums.
Defines sequences as ordered lists and as functions from natural numbers to terms, and shows how to use rules to generate and identify finite versus infinite sequences.
Identify arithmetic sequences by recognizing a fixed common difference and using the formula a_n = a + (n-1)d to find terms, illustrated with examples and a thousandth term calculation.
Dissect geometric sequences by multiplying by a fixed common ratio, identify the first term, and apply the nth term formula a r^(n-1) to find any term.
Learn to find partial sums of arithmetic sequences using the formulas S_n = n/2 [2a + (n-1)d] or S_n = n/2 (a_1 + a_n), and apply sigma notation to sums.
Use S_n = a1(1 − r^n)/(1 − r) to compute partial sums of geometric sequences; examples show S6 = 263 for 1,2,4,8,16,32 and S6 ≈ 3.83 with a1 = 7, r = −2/3.
Explore series by revisiting sequences, including arithmetic and geometric progressions, and learn how partial sums lead to convergence or divergence in infinite series.
Download the attached pdf of extra practice problems with solutions to check your steps and solidify the discrete mathematics concepts covered in this section.
Celebrate finishing the discrete mathematics course and revisit lectures to reinforce concepts while posting questions and feedback. Enjoy a special Udemy gift with a coupon toward future courses.
WHAT IS THIS COURSE ABOUT?
Discrete Mathematics (DM) is the backbone of both Mathematics and Computer Science. Unlike continuous mathematics, DM focuses on discrete structures—sets, logic, numbers, graphs, and more—making it a core subject for any Math or CS student.
The concepts in this course provide the mathematical foundation for computer science (data structures, algorithms, database theory) as well as many areas of pure and applied math (linear algebra, abstract algebra, combinatorics, probability, and number theory). Mastering these topics will not only sharpen your problem-solving skills but also prepare you for advanced courses, research, and even coding interviews.
This course is structured into the following core sections:
Sets
Logic
Number Theory
Proofs
Functions
Relations
Graph Theory
Statistics
Combinatorics
Sequences and Series
YOU WILL ALSO GET:
400+ practice problems with full solutions, ranging from beginner to challenging
Quizzes after each lecture to test your understanding
Lifetime access to all course content
Direct support in the Q&A section
Certificate of Completion
30-Day Money-Back Guarantee
HOW IS IT DELIVERED?
This course is built with visual learners in mind. Complex topics are broken down into clear, step-by-step video lessons. You’ll see problems worked through in real time, making even the most abstract ideas simple and approachable. Some lessons include downloadable text explanations and additional worked examples.
All content is delivered in plain English — no unnecessary jargon — so you can focus on mastering the concepts, not deciphering the terminology.
HOW DO I LEARN BETTER?
Learning math is about practice and repetition. After each lecture, you’ll find a short quiz to reinforce your understanding. At the end of each section, there are 25 carefully designed practice problems (with detailed solutions) so you can apply what you’ve learned and build confidence. Revisiting lessons and re-working problems is strongly encouraged — that’s how mastery happens.