This is a channel created for the Math lovers inside us. The subjects that are focused more are Theoretical Computer Science subjects. Discrete Mathematics including Combinatorics and graph theory videos can be found here. This channel may be of help also to the GATE aspirants and research candidates for theoretical CS stream.

Let's learn together..

Fundamental Theorem of Arithmetic - Proof | Unique Prime Factorization
9:45
Fundamental Theorem of Arithmetic - Proof | Unique Prime Factorization
Randomized Algorithm | Success Probability Amplification | RP & BPP complexity classes
55:56
Randomized Algorithm | Success Probability Amplification | RP & BPP complexity classes
Counting Number of Increasing Functions | Number of Non-Decreasing functions
10:46
Counting Number of Increasing Functions | Number of Non-Decreasing functions
Counting number of Strictly Increasing Functions
2:40
Counting number of Strictly Increasing Functions
Increasing Function | Strictly Increasing Function | Example and Non-Example
3:33
Increasing Function | Strictly Increasing Function | Example and Non-Example
Probability of at least 4 consecutive heads occurring | 10 coin tosses | Exercise 1.1 (d)
14:21
Probability of at least 4 consecutive heads occurring | 10 coin tosses | Exercise 1.1 (d)
Pigeonhole principle Application : Property of an (n+1) size subset of [2n]
7:47
Pigeonhole principle Application : Property of an (n+1) size subset of [2n]
Probability & Computing Problem solving series | Mitzenmacher & Upfal | Exercise 1.1 (c)
6:12
Probability & Computing Problem solving series | Mitzenmacher & Upfal | Exercise 1.1 (c)
Number of ways of Distributing 'n' Identical objects into 'm' Distinct containers | Combinatorics
12:57
Number of ways of Distributing 'n' Identical objects into 'm' Distinct containers | Combinatorics
Probability & Computing Problem Solving series | Exercise 1.1 (b) | Mitzenmacher & Upfal
7:17
Probability & Computing Problem Solving series | Exercise 1.1 (b) | Mitzenmacher & Upfal
Probability & Computing Problem Solving Series | Mitzenmacher & Upfal | Exercise 1.1 a | Let's solve
5:11
Probability & Computing Problem Solving Series | Mitzenmacher & Upfal | Exercise 1.1 a | Let's solve
Existence Proof : Constructive & Non-Constructive | Explained with Examples
5:50
Existence Proof : Constructive & Non-Constructive | Explained with Examples
Number of Handshakes between 'n' people : Formula | Handshake Problem | Two Methods of Counting
3:57
Number of Handshakes between 'n' people : Formula | Handshake Problem | Two Methods of Counting
0.999... = 1 Here is the proof !
1:00
0.999... = 1 Here is the proof !
Combinatorial Proof : C(2n,2) = 2*C(n,2) + n^2 | Combinatorial Proofs-3
3:30
Combinatorial Proof : C(2n,2) = 2*C(n,2) + n^2 | Combinatorial Proofs-3
0.9 bar = 1 | 0.999..(infinite 9s) = 1 | PROOF
1:56
0.9 bar = 1 | 0.999..(infinite 9s) = 1 | PROOF
Combinatorial Proof : part 2 | Why k * C(n, k) = n * C(n-1, k-1) ?
3:23
Combinatorial Proof : part 2 | Why k * C(n, k) = n * C(n-1, k-1) ?
What is Combinatorial Proof ? Why C(n, r) = C(n, n-r) ? : a Combinatorial proof | Part - 1
5:59
What is Combinatorial Proof ? Why C(n, r) = C(n, n-r) ? : a Combinatorial proof | Part - 1
Application of Pigeon Hole Principle : Problem 1 | Combinatorics
5:17
Application of Pigeon Hole Principle : Problem 1 | Combinatorics
Well Ordered Set : Explained with Examples | Well Ordering Relation
7:59
Well Ordered Set : Explained with Examples | Well Ordering Relation
Totally Ordered Set : Explained with Examples | Total Order Relation
5:59
Totally Ordered Set : Explained with Examples | Total Order Relation
Partially Ordered Set : Explained with Examples | Partial Ordering Relation
11:58
Partially Ordered Set : Explained with Examples | Partial Ordering Relation
Number of Symmetric Relations on a set with 'n' elements | Detailed Explanation
11:53
Number of Symmetric Relations on a set with 'n' elements | Detailed Explanation
Surprise Test Paradox | An Episode in the Life of a Student
1:50
Surprise Test Paradox | An Episode in the Life of a Student
Number of Reflexive Relations on Set with n elements | Reflexive Relation | Total Possible Relations
12:47
Number of Reflexive Relations on Set with n elements | Reflexive Relation | Total Possible Relations
Combinatorics GATE Question | Number of ways of placing 'n' 0s and 'k' 1s : No two 1s Adjacent
5:33
Combinatorics GATE Question | Number of ways of placing 'n' 0s and 'k' 1s : No two 1s Adjacent
GATE Combinatorics Question -1 | GATE 03
3:00
GATE Combinatorics Question -1 | GATE 03
Number of Non-Negative Integer solutions of the equation x + y + z = 10 | General Case Explained
9:41
Number of Non-Negative Integer solutions of the equation x + y + z = 10 | General Case Explained
Number of One-to-One Functions | Counting | Injective Function | Discrete Mathematics
5:35
Number of One-to-One Functions | Counting | Injective Function | Discrete Mathematics
Number of ways of Arranging letters in the word : Two letters Adjacent | All Vowels Together
5:58
Number of ways of Arranging letters in the word : Two letters Adjacent | All Vowels Together