Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. In contrast to real numbers that have the property of varying "smoothly", the objects studied in discrete mathematics – such as integers, graphs, and statements in logic[1] – do not vary smoothly in this way, but have distinct, s...
Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. In contrast to real numbers that have the property of varying "smoothly", the objects studied in discrete mathematics – such as integers, graphs, and statements in logic[1] – do not vary smoothly in this way, but have distinct, s...
Rubik's Cube Example
3mFactorial Example
3mPaper Folding Example
3mMotivation for Counting
3mMotivation for Catalan numbers
3mCounting in Computer Science
3mRule of Sum and Rule of Product
2mProblems on Rule of Sum and Rule of Product
10mFactorial Explained
49 secProof of n! - Part 1
2mProof of n! - Part 2
4mPermutations - Part 1
1mAstronomical Numbers
1mProblems on Permutations
11mPermutations - Part 4
11mPermutations - Part 3
11mPermutations - Part 2
11mCombinations - Part 2
1mCombinations - Part 1
1mCombinations - Part 3
1mCombinations - Part 4
4mProblems on Combinations
9mDifference between Permuations and Combinations
1mCombination with Repetition - Part 1
4mCombination with Repetition - Part 2
4mCombination with Repetition - Problems
4mProblems on Binomial theorem
1mMultinomial theorem
1mChapter Summary
1mExamples of Catalan numbers
1mCatalan Numbers - Part 4
1mCatalan Numbers - Part 2
1mCatalan Numbers - Part 1
1mFun facts on Pascal's Triangle
1mCatalan Numbers - Part 3
1mProperties of Binomial theorem
1mPascal's Triangle
1mBinomial theorem
1mApplications of Binomial theorem
1mIntroduction to Set Theory
1mExample, definiton and notation
5mSets - Problems Part 1
7mSubsets - Part 1
58 secSubsets - Part 2
6mSubsets - Part 3
2mUnion and intersections of sets
3mUnion and intersections of sets - Part 1
1mUnion and intersections of sets - Part 2
1mSummary
23 secSymmetric difference
23 secHistory
23 secSet difference - Part 2
23 secSet difference - Part 1
23 secDe Morgan's Laws - Part 4
23 secDe Morgan's Laws - Part 3
23 secA proof technique
23 secDe Morgan's Laws - Part 2
23 secDe Morgan's Laws - Part 1
23 secComplement of a set
23 secPower set - Problems
23 secConnection betwenn Binomial Theorem and Power Sets
23 secPower set - Part 3
23 secPower set - Part 2
23 secPower Set - Part 1
23 secCardinality of Union of three sets
23 secCardinality of Union of sets - Part 2
23 secCardinality of Union of two sets - Part 1
23 secUnion and intersections of sets - Part 3
23 secTruthtable for OR operator
2mIntroduction to OR operator
2mMotivation for OR operator
2mExamples for Negation
2mNegation - Truthtable
2mNegation - Explanation
2mExamples and Non-examples of Statements
2mIntroduction to Statements
2mIntroduction to Negation
2mMotivational example
2mOR operator for 3 Variables
2mTruthtable for AND operator
2mPrimitive and Compound statements - Part 2
3mPrimitive and Compound statements - Part 1
3mAND operator for 3 Variables
3mProblems involoving NOT, OR and AND operators
3mExamples and Non-examples of Implication - Part 1
6mIntroduction to implication
6mExamples and Non-examples of Implication - Part 2
3mExplanation of Implication
5mIntroduction to Double Implication
1mLogical Equivalence - Part 3
2mLogical Equivalence - Part 2
2mLogical Equivalence - Part 1
2mSAT Problem - Part 2
2mSAT Problem - Part 1
2mTautology, Contradiction - Part 3
2mTautology, Contradiction - Part 2
2mTautology, Contradiction - Part 1
2mDouble negation - Part 2
1mDouble negation - Part 1
1mMotivation for laws of logic
1mXOR operator - Part 3
1mXOR operator - Part 2
1mXOR operator - Part 1
1mConverse, Inverse and Contrapositive
1mProblems
1mExplanation of Double Implication
1mLaws of Logic
7mLogical Equivalence - Part 4
2mDe Morgan's Law - Part 2
2mDe Morgan's Law - Part 1
2mConclusion
3mRules of Inferences - Part 7
3mRules of Inferences - Part 6
3mRules of Inferences - Part 5
3mRules of Inferences - Part 4
3mRules of Inferences - Part 3
3mRules of Inferences - Part 2
3mRules of Inferences - Part 1
3mNumber of relations - Part 1
1mExamples of Relations
1mRevisiting Representations of a Relation
1mSet Representation of a Relation
1mCartesian Product
1mRelation - An Example
1mMatrix Representation of a Relation
1mVarious sets
1mGraphical Representation of a Relation
1mIntroduction to Relation
1mNumber of symmetric relations - Part 1
36 secSymmetric Relation - Examples and non examples
36 secParallel lines revisited
36 secSymmetric Relation - Matrix representation
36 secSymmetric Relation - Introduction
36 secNumber of Reflexive relations
36 secReflexive relation - Matrix representation
36 secExample of a Reflexive relation
36 secReflexive relation - Introduction
36 secNumber of relations - Part 2
36 secCondition for relation to be reflexive
2mNumber of Antisymmetric relations
2mAntisymmetric - Matrix representation
2mAntisymmetric - Graphical representation
2mExamples of Transitive and Antisymmetric Relation
2mAntisymmetric relation
2mTransitive relation - Examples and non examples
2mPattern
2mNumber of symmetric relations - Part 2
2mExamples of Reflexive and Symmetric Relations
2mPartition - Part 5.
9mPartition - Part 5
9mPartition - Part 4
9mPartition - Part 3
9mPartition - Part 2
9mPartition - Part 1
9mEquivalence relation - Example 4
9mEquivalence relation
9mCondition for relation to be antisymmetric
9mCondition for relation to be symmetric.
9mCondition for relation to be symmetric
9mCondition for relation to be reflexive.
9mCondition for relation to be reflexive..
9mFew notations
9mIntroduction to Onto Function - Part 1
43 secCardinality condition in One-One function - Part 1
43 secCardinality condition in One-One function - Part 2
43 secExamples and Non- examples of One-One function
43 secOne-One Function - Example 3
43 secProving a Function is One-One
43 secOne-One Function - Example 2
43 secOne-One Function - Example 1
43 secIntroduction to One-One Function
43 secRelations vs Functions - Part 2
43 secRelations vs Functions - Part 1
43 secDefintion of a function - Part 3
43 secDefintion of a function - Part 2
43 secDefintion of a function - Part 1
43 secIntroduction to functions
43 secExample - 4 Explanation
43 secMotivational Example - 3
43 secCommonality in examples
43 secMotivational Example - 2
43 secMotivational Example - 1
43 secNumber of functions
3mCounting number of functions
3mCardinality condition in Bijection - Part 2
3mCardinality condition in Bijection - Part 1
3mExamples of Bijection
3mIntroduction to Bijection
3mCardinality condition in Onto function - Part 2
3mCardinality condition in Onto function - Part 1
3mExamples of Onto Function
3mDefinition of Onto Function
3mIntroduction to Onto Function - Part 2
3mApplication of inverse functions - Part 1
1mExamples of Inverse functions
1mInverse functions
1mMotivation for Inverse functions
1mExample of Composition of functions - Part 2
1mExample of Composition of functions - Part 1
1mWhy study Composition of functions
1mDefinition of Composition of functions
1mMotivation for Composition of functions - Part 2
1mMotivation for Composition of functions - Part 1
1mCounting number of functions.
1mNumber of Bijections
1mNumber of Onto functions
1mNumber of One-One functions - Part 3
1mNumber of One-One functions - Part 2
1mNumber of One-One functions - Part 1
1mChecker board and triominoes - Solution
1mChecker board and Triomioes - A puzzle
5mBinomial Coeffecients - Proof by induction
5mMathematical Induction - Example 10 solution
5mMathematical Induction - Example 9
5mMI - Inequality 2 solution
5mMI - Inequality 2
5mMI - Problem on satisfying inequalities (solutions)
5mMI - Problem on satisfying inequalities
5mMI - To prove divisibility
5mMI - Inequality 1 (solution)
5mMI - Inequality 1
5mMI - To prove divisibility (solution)
5mMI - Sum of powers of 2
5mMI - Sum of odd numbers
5mMathematical Induction - The formal way
5mMathematical Induction - Its essence
5mMathematical induction - An illustration
5mThree stories
5mThree stories - Connecting the dots
5m10 points on an equilateral triangle
2mSet of n integgers
2mGroup of n people
2mMotivation for Pegionhole Principle
2mA false proof - Solution
2mMathematical induction - An important note
2mMathematical Induction - A false proof
2mPegionhole Principle - A result
39 secConsecutive integers
39 secConsecutive integers solution
1mMatching initials
1mNumbers adding to 9
45 secMatching initials - Solution
45 secNumbers adding to 9 - Solution
1mDeck of cards
1mNumber of errors - Solution
2mNumber of errors
2mDeck of cards - Solution
2mPuzzle - Challenge for you
4mSubgraph
1mRelation between walk and path - An induction proof
1mRelation between walk and path
1mExample of cycle and circuit
1mCycle and circuit
1mExamples of walk, trail and path
1mDefinitions revisited
1mPath and closed path
1mWalk
1mRegular graph and irregular graph
1mTrail
1mHavel Hakimi theorem - Part 5
1mHavel Hakimi theorem - Part 4
1mHavel Hakimi theorem - Part 3
1mHavel Hakimi theorem - Part 2
1mHavel Hakimi theorem - Part 1
1mProblems based on Hand shaking lemma
1mHand shaking lemma - Corollary
1mRelation between number of edges and degrees - Proof
1mRelation between number of edges and degrees
1mDefintion of a Graph
1mColoring the India map
1mDegree and degree sequence
1mConnectedness through Connecting people
1mTraversing the bridges
1mThree utilities problem
1mFriendship - an interesting property
1mIntroduction to Python - Installation
1mNetworkX - Need of the hour
1mIllustration of cut vertices and cut edges
1mCut edge
1mCut vertex
1mConnecting connectedness and path - An illustration
1mConnecting connectedness and path
1mEdge condition for connectivity
1mProperty of a cycle
1mConnected and Disconnected graphs
1mIntroduction to Tree
1mSpanning and induced subgraph - A result
1mSpanning and induced subgraph
1mIntroduction to Python - Basics
13mIntroduction to NetworkX
13mStory so far - Using NetworkX
13mGraph representations - Introduction
26 secIllustration of Directed, weighted and multi graphs
26 secDirected, weighted and multi graphs
26 secAdjacency matrix representation
26 secIsomorphism - Introduction
1mIncidence matrix representation
1mIsomorphic graphs - An illustration
4mIsomorphic graphs - A challenge
34 secNon - isomorphic graphs
1mIsomorphism - A question
1mComplement of a Graph - Introduction
1mComplement of a Graph - Illiustration
2mSelf complement
2mComplement of a disconnected graph is connected
38 secWhich is more? Connected graphs or disconnected graphs?
4mComplement of a disconnected graph is connected - Solution
4mDefinition of Eulerian Graph
30 secBipartite graphs - Converse part of the puzzle
30 secBipartite graphs - A puzzle
30 secBipartite graphs
30 secPlanar graphs - Inequality 1
5m3 Utilities problem - Revisited
5mLitmus test for planarity
5mFamous non-planar graphs
5mProof of V - E + R = 2
5mV - E + R = 2; Use induction
5mIllustration of V - E + R =2
5mV - E + R = 2
5mExamples of Planar graphs
5mDefinition of a Planar graph
5mConstructing non intersecting roads
5mImportance of Hamiltonian graphs in Computer science
5mEulerian and Hamiltonian Are they related
5mDirac's Theorem v/s Ore's Theorem
5mOre's Theorem
5mDirac's theorem - A note
5mDirac's Theorem
5mA result on Path
5mA result on connectedness
5mHamiltonian graph - A result
5mExamples of Hamiltonian graphs
5mDefintion of Hamiltonian graphs
5mCan you traverse all location?
5mWhy the name Eulerian
5mA condition for Eulerian trail
5mProof for even degree implies graph is eulerian
5mWhy even degree?
5mLitmus test for an Eulerian graph
5mNon- example of Eulerian graph
5mIllustration of eulerian graph
5mRecalling the India map problem - Solution
1mRecalling the India map problem
1mExamples on Proper coloring
1mChromatic number of a graph
1mPrisoners example and Proper coloring
1mNetworkX - Digraphs
6mNetworkX - Adjacency matrix
9mNetworkX- Random graphs
16mNetworkX - Subgarph
5mNetworkX - Isomorphic graphs: A game to play
4mNetworkX - Isomorphic graphs Part 1
4mNetworkX - Isomorphic graphs Part 2
4mNetworkX - Graph complement
6mCounting in a creative way
41 secNetworkX - Coloring
41 secNetworkX - Bipaprtite graphs
41 secNetworkX - Eulerian graphs
41 secPicking five balls - Solution
3mExample 2 - Picking five balls
3mPicking five balls - Another version
3mWords and the polynomial - Explained
3mWords and the polynomial
3mExample 1 - Fun with words
3mDefintion of Generating function
2mGenerating function examples - Part 2
2mGenerating function examples - Part 1
2mPicking 7 balls - The naive way
3mBinomial expansion - Explained
3mBinomial expansion - A generating function
3mGenerating function examples - Part 3
3mGenerating functions - Problem 1
3mPicking 7 balls - The creative way
3mGenerating functions - Problem 2
7mGenerating functions - Problem 3
1mWhy Generating function?
1mIntroduction to Advanced Counting
1mExample 1 : Dogs and Cats
1mInclusion-Exclusion Formula
1mProof of Inclusion - Exlusion formula
1mExample 2 : Integer solutions of an equation
1mExample 3 : Words not containing some strings
1mExample 4 : Arranging 3 x's, 3 y's and 3 z's
1mExample 5 : Non-multiples of 2 or 3
1mExample 6 : Integers not divisible by 5, 7 or 11
1mA tip in solving problems
1mExample 7 : A dog nor a cat
1mExample 8 : Brownies, Muffins and Cookies
1mExample 10 : Integer solutions of an equation
1mExample 11 : Seating Arrangement - Part 1
1mExample 11 : Seating Arrangement - Part 2
1mExample 12 : Integer solutions of an equation
1mNumber of Onto Functions.
1mFormula for Number of Onto Functions
1mExample 13 : Onto Functions
1mExample 14 : No one in their own house
12mDerangements
12mDerangements of 4 numbers
12mExample 15 : Bottles and caps
12mExample 16 : Self grading
12mExample 17 : Even integers and their places
12mExample 18 : Finding total number of items
12mExample 19 : Devising a secret code
12mPlacing rooks on the chessboard
12mRook Polynomial
12mRook Polynomial.
12mMotivation for recurrence relation
9mGetting started with recurrence relations
9mRecurrence relation for Merge sort
5mWhat is a recurrence relation?
5mCompound Interest as a recurrence relation
5mExamples of recurrence relations
5mExample - Number of ways of climbing steps
5mNumber of ways of climbing steps: Recurrence relation
5mExample - Rabbits on an island
5mExample - n-bit string
5mExample - n-bit string without consecutive zero
5mSolving Linear Recurrence Relations - A theorem
5mA note on the proof
5mSoving recurrence relation - Example 1
5mSoving recurrence relation - Example 2
5mFibonacci Sequence
5mIntroduction to Fibonacci sequence
5mSolution of Fibbonacci sequence
5mA basic introduction to 'complexity'
5mIntuition for 'complexity'
5mVisualizing complexity order as a graph
5mTower of Hanoi
5mReccurence relation of Tower of Hanoi
5mSolution for the recurrence relation of Tower of Hanoi
5mA searching technique
5mRecurrence relation for Binary search
5mSolution for the recurrence relation of Binary search
5mExample: Door knocks example
5mExample: Door knocks example solution
5mDoor knock example and Merge sort
5mIntroduction to Merge sort - 1
5mCorrespondence between partition and generating functions: In general
8mCorrespondence between partition and generating functions
8mChromatic polynomial of cycle on 4 vertices - Part 2
8mChromatic polynomial of cycle on 4 vertices - Part 1
8mChromatic polynomial of complete graphs
8mIntroduction to Chromatic polynomial
8mIntoduction to advanced topics
8mGroups: Examples and non-examples
8mFormal definition of a Group
8mUniqueness of the identity element
8mIntroduction to Group Theory
8mRecurrrence relation: The theorem and its proof
8mMotivation for exponential generating function
8mExample: Picking 4 letters from the word 'INDIAN'
8mWhy 'partitions' to 'polynomial'?
8mDistinct partitions equals odd partitions: Proof
8mDistinct partitions equals odd partitions: Observation
8mOdd partitions and generating functions
8mDistinct partitions and generating functions
8mDistinct partitions and odd partitions
8mConclusion.
4mSummary.
4mLagrange's theorem
4mSubgroup: Defintion and examples
4mGroups: Special Examples Part 2
4mGroups: Special Examples Part 1
4m