
Introduction and Description of a Set
Explore how to determine if a collection is a set, and convert between roster and set-builder forms using natural numbers and integers as examples.
Types of Sets
Explore Venn diagrams to visualize set operations like union, intersection, difference, symmetric difference, and complement within a universal set, using practical set examples.
solve set problems with A, B, C defined by equations, list elements, and compute unions and intersections, including A∪B, B∩C, A∪(B∩C), (A∪B)∩C, and A∩B∩C.
Explore the laws of the algebra of sets, including union and intersection. See how the empty set and universal set affect these laws in problems.
Learn how the number of subsets of finite sets equals a power of two and how to determine the element counts when one set has 56 more subsets than another.
Cartesian Product of sets
Explore set operations in discrete math, including unions and intersections of B and C and the cross product A × (B ∩ C), with step-by-step examples.
Compute the cross products A × B and B × A for A = {1,2,3} and B = {2,3}, listing all ordered pairs like (1,2), (1,3), (2,2), (2,3), (3,2), (3,3).
Relation : Introduction & Domain , Codomain and Range
We define a relation on the natural numbers via a+3b=12, derive the ordered pairs (9,1), (6,2), (3,3), and identify the domain {9,6,3} and range {1,2,3}.
Types of Relations
Learn how even functions satisfy f(-x) = f(x) and odd functions satisfy f(-x) = -f(x), and identify functions that are neither even nor odd.
Explore domain determination and function evaluation, including explicit and implicit expressions, plus tests for even and odd behavior, using logarithm and rational function properties.
Understand composite functions: g∘f maps A to C as g(f(x)) with f:A→B and g:B→C, and may differ from f∘g, yet is associative and bijective when f and g are bijective.
Explore the composition of functions with g(f(x)) and f(g(x)) using f(x)=x^2+2 and g(x)=x/(x-1), showing that the two compositions need not be equal.
Illustrates composing the function f(x)=x/√(1+x^2) through repeated applications and proves that f(f(f(x))) = x/√(1+3x^2) via step-by-step algebraic simplification.
Derive the inverse of f x equals 2x minus 3 by solving for x in terms of y, then replace y by x to obtain f inverse x equals (x+3)/2.
Find the value of f inverse nine by setting f inverse nine equal to x, which yields f x equals nine, and solving x^2+5x=0 to obtain x=0 or x=-5.
Find the inverse of f(x) = 1/(1 − x) by solving for x in terms of y, yielding f^{-1}(x) = (x − 1)/x.
Illustration presents basic counting and sequence ideas from one to nine, forming chains and groups of even terms while introducing simple numerical reasoning in discrete math.
Shane Watson explains factorials, highlighting 4!, 5!, and 6!, and shows that 6! equals 720.
Explore discrete math concepts using factorials and simple algebra with numbers, illustrated by a pictorial approach to a plus two and a plus one.
Explore the fundamental principle of counting and the multiplication rule, showing how the number of outcomes equals the product of choices in sequence, with examples of selecting students and options.
Illustration 1 demonstrates the multiplication principle in discrete math by counting sequential choices: eight options for the first activity and seven for the second, yielding 56 possible complete sequences.
Learn to count four-letter words under word rules, comparing repetition allowed versus not allowed. Apply the multiplication principle and permutation concepts to compute the counts for each case.
Understand permutations, where order matters, and apply the factorial formula to count arrangements of objects.
Explore permutations using the nPr formula and factorials, illustrating counting arrangements of letters and objects, including word formation and comparison of different arrangement cases.
Explore combinations through the ncr formula, learn to compute binomial coefficients, and apply methods with practical examples to solve counting problems in discrete math.
Study basic logic: define statements, distinguish simple from compound statements, and apply negation, conjunction, disjunction, and exclusive or with truth tables.
Construct a truth table for the negation of B, analyze cases where B is true or false, and determine how compound sentences evaluate to true or false.
Explore the basic concepts of mathematical induction, including statements versus sentences, and demonstrate a first-principles induction proof using base and step cases on natural numbers.
Prove by the principle of mathematical induction that the sum of squares from 1 to n equals n(n+1)(2n+1)/6, with base case n = 1 and P(k) implies P(k+1).
Use the principle of mathematical induction to prove that 1 + x + x^2 + ... + x^n = (x^{n+1}-1)/(x-1), validating base case and inductive step.
This course on Discrete Mathematics can be used by the the students of math , computer science and Engg. as an introduction to the fundamentals. Discrete Mathematics / Discrete Math is the backbone of Computer Science and Mathematics . It is the study of topics that are discrete rather than continuous. The topics that are covered in this course are the essential ones which are required to be learned and understood by every Computer science or engineering student. The goal of this course is to build up a strong mathematical foundation for students so that they may use their knowledge in building up technological areas like data structures, algorithms and database theory,
This course can be broken into a few key categories:
Set theory
Relations
Functions
Combinatorics
Logics
Principle of Mathematical Induction
Each of the above topics has a simple explanation of concepts so that students may grasp them easily.
I am sure that this course will be create a strong platform for students and those who are studying for higher Mathematics and would help them in a better understanding of the subject.
You will also get a good support in Q&A section . It is also planned that based on your feed back, new course materials like Graph theory etc. and many more may be added to the course. Hope the course will develop better understanding and boost the self confidence of the students.
Waiting for you inside the course!
So hurry up and Join now !!