- 78
- 318 376
Learn with Sreyas
India
Registrace 22. 07. 2020
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..
Let's learn together..
Fundamental Theorem of Arithmetic - Proof | Unique Prime Factorization
In this video, we will discuss the Fundamental theorem of Arithmetic. The theorem statement is well explained and its proof is discussed with breaking down into existence part proof and uniqueness part proof.
zhlédnutí: 7 862
Video
Randomized Algorithm | Success Probability Amplification | RP & BPP complexity classes
zhlédnutí 405Před 2 lety
In this video, we start with a slight motivation for choosing randomized algorithm, we tell what is a Monte Carlo algorithm, and what a Las Vegas algorithm is. We discuss about the randomized complexity classes, and their success probability amplification also.
Counting Number of Increasing Functions | Number of Non-Decreasing functions
zhlédnutí 920Před 2 lety
In this video, we discuss the idea of how to count number of increasing functions. Link to the video of how to count number of non-negative integer solutions of equation: czcams.com/video/KYaXL75Z1HM/video.html
Counting number of Strictly Increasing Functions
zhlédnutí 1,1KPřed 2 lety
In this video, we count the number of strictly increasing functions from the domain set {1,2,3} to co-domain set {1,2,3,4,5}. The idea behind counting has been made clear. A question has been posed at the end. Try solving it.
Increasing Function | Strictly Increasing Function | Example and Non-Example
zhlédnutí 656Před 2 lety
In this video, we discuss what is an Increasing function and Strictly Increasing function. Also, have given some examples, non-examples and few questions to try for better understanding.
Probability of at least 4 consecutive heads occurring | 10 coin tosses | Exercise 1.1 (d)
zhlédnutí 2,2KPřed 2 lety
When a fair coin is tossed 10 times, what is the probability of the event that at least 4 consecutive heads occur? Exercise 1.1d, Mitzenmacher and Upfal textbook "Probability and Computing" . Let's solve together.
![Pigeonhole principle Application : Property of an (n+1) size subset of [2n]](http://i.ytimg.com/vi/1EAMCnKo6Kc/mqdefault.jpg)
Pigeonhole principle Application : Property of an (n+1) size subset of [2n]
zhlédnutí 5KPřed 2 lety
In this video, we discuss an application of pigeonhole principle. If we select any n 1 numbers from the set {1,2,..,2n}, there are always two integers such that one divides another. Let's prove it.
Probability & Computing Problem solving series | Mitzenmacher & Upfal | Exercise 1.1 (c)
zhlédnutí 483Před 3 lety
A fair coin is flipped 10 times. What is the probability of the event that , the i th flip and (11-i) th flip are same for i=1,2,3,4,5. ? We discuss the answer to this question. This is a series where we solve exercise questions from the textbook "Probability and Computing" by Mitzenmacher and Upfal. Let's solve together.
Number of ways of Distributing 'n' Identical objects into 'm' Distinct containers | Combinatorics
zhlédnutí 5KPřed 3 lety
In this video, we discuss how many ways can we distribute n identical objects into m distinct containers. Along with the generalized case, we also discuss how many ways can we distribute 5 identical balls to 3 distinct containers or boxes.
Probability & Computing Problem Solving series | Exercise 1.1 (b) | Mitzenmacher & Upfal
zhlédnutí 332Před 3 lety
In this video, we are solving this question, when 10 fair coins are tossed, what is the probability that there are more heads than tails? We solve the exercise questions in Mitzenmacher and Upfal textbook of Probability and Computing. Let's solve together.
Probability & Computing Problem Solving Series | Mitzenmacher & Upfal | Exercise 1.1 a | Let's solve
zhlédnutí 720Před 3 lety
This is the beginning of Probability Problem Solving series. We solve the exercise questions in the textbook "Probability and Computing" by Michael Mitzenmacher and Eli Upfal. In this video, we solve the exercise 1.1 a question. What is the probability of the event that number of heads = number of tails, where the experiment is tossing coin 10 times. Let's solve.
Existence Proof : Constructive & Non-Constructive | Explained with Examples
zhlédnutí 4,3KPřed 3 lety
In this video, we are going to see two types of existence proof, constructive and non constructive. Both types of proof are explained with examples.
Number of Handshakes between 'n' people : Formula | Handshake Problem | Two Methods of Counting
zhlédnutí 1,5KPřed 3 lety
In this video, we discuss how to count the number of handshakes between n people, where each person shakes hands with every other person exactly once. Two methods to count the number of handshakes are discussed.
0.999... = 1 Here is the proof !
zhlédnutí 188Před 3 lety
Here, we show that 0.9 bar is same as 1. That is, 0.99.. (infinite number of 9s) is equal to 1. A beautiful proof is included.
Combinatorial Proof : C(2n,2) = 2*C(n,2) + n^2 | Combinatorial Proofs-3
zhlédnutí 8KPřed 3 lety
In this video, we discuss the combinatorial proof for why 2n choose 2 is same as 2 * n choose 2 n square. A combinatorial proof is given for the identity C(2n,2) = 2*C(n,2) n^2 . Playlist : czcams.com/play/PL6ZJ9odizzxUf7geCDjupgPTG0Jp4NtM4.html
0.9 bar = 1 | 0.999..(infinite 9s) = 1 | PROOF
zhlédnutí 2,3KPřed 3 lety
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) ?
zhlédnutí 3,1KPřed 3 lety
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
zhlédnutí 5KPřed 3 lety
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
zhlédnutí 1KPřed 3 lety
Application of Pigeon Hole Principle : Problem 1 | Combinatorics
Well Ordered Set : Explained with Examples | Well Ordering Relation
zhlédnutí 31KPřed 3 lety
Well Ordered Set : Explained with Examples | Well Ordering Relation
Totally Ordered Set : Explained with Examples | Total Order Relation
zhlédnutí 23KPřed 3 lety
Totally Ordered Set : Explained with Examples | Total Order Relation
Partially Ordered Set : Explained with Examples | Partial Ordering Relation
zhlédnutí 1,7KPřed 3 lety
Partially Ordered Set : Explained with Examples | Partial Ordering Relation
Number of Symmetric Relations on a set with 'n' elements | Detailed Explanation
zhlédnutí 5KPřed 3 lety
Number of Symmetric Relations on a set with 'n' elements | Detailed Explanation
Surprise Test Paradox | An Episode in the Life of a Student
zhlédnutí 323Před 3 lety
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
zhlédnutí 3,8KPřed 3 lety
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
zhlédnutí 149Před 3 lety
Combinatorics GATE Question | Number of ways of placing 'n' 0s and 'k' 1s : No two 1s Adjacent
GATE Combinatorics Question -1 | GATE 03
zhlédnutí 335Před 3 lety
GATE Combinatorics Question -1 | GATE 03
Number of Non-Negative Integer solutions of the equation x + y + z = 10 | General Case Explained
zhlédnutí 15KPřed 3 lety
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
zhlédnutí 10KPřed 3 lety
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
zhlédnutí 3,7KPřed 3 lety
Number of ways of Arranging letters in the word : Two letters Adjacent | All Vowels Together
Bhai bokla gaya hai kya, dimaag mein bhusa bhara hai kya,
Really nice, thanks!
Thabk you sir! Thanks a lot
Thanks
Part 1?
Thank you for the video!! really helpful
Good video sir......... good good good..........🎉🎉🎉🎉🎉🎉🎉
Thanks a lot for the explanation... ❤️
wonderful explaination
Great! 😊
Awesomely explained, thank you!
well explained
Thank you for explaining! Everything is clear now!
THIS IS SOO UNDER-RATED!!!
R1 for transitive example is not transitive because we don’t have 2,4
It is transitive. Please check the definition once again
How on earth is this channel so underrated? Amazing explanation.
Where is the formula derivation brother ???
Thank you for this video! understood it perfectly thanks to you
At 3:44 girl will say yes for the same reason boy had said yes when asked him 2nd time
🎉🎉🎉 clear
Indo indo 😂😂😂. Thanks though
Superb class sir, great explanation....❤🔥👌👌
Thank you
10/10 very helpful 😅
great video but i have a question. how would one find the Probability of at least 4 consecutive heads occurring within 10 coin tosses, if it wasn't a fair coin toss? such as if the probability of heads and tails was 60% and 40%, respectively.
Thanks a bunch
Nice sir. TQSM
OMG THANKS SO MUCH....THIS WAS THE ONLY VIDEO THAT HELPED A BUNCH ❤
Thank you, glad that it helped :)
Thank you for clearing this all time doubt
Glad it was helpful!
you're cooking me sreyas
Same handwriting
Thank you🙏
Great explanation 👏
Thank you
What is the difference between an axiomatic approach to say geometry and a non-axiomatic approach to geometry? Is there a name for “non-axiomatic” ?
Incredible! Thank you
Thank you
Wonderful explanation 🔥🔥👌🏻👌🏻👌🏻👌🏻
This was the first video that actually helped me understand this! Thank you!
Parang may mali sa transitive.. Sa R4= (1,4),(4,1),(1,1) Hindi ba transitive naman yan?
Thank you random Indian guy on the internet. Without you I wouldn't have done my discrete math homework
I see. So the possibility of 5 or more consecutive heads is still in the calculation. The brilliance here is seeing all of these disjoint sets.
Love you bro! you saved me from my midterm
what is the meaning of a totally ordered set?
What do we mean by 1 divides 2 and 2 does not divide 1
When 1 is divided by 2, remainder is not 0. That's why
Thank you very much. This certainly helps!
Thankyou sir i am tired of seeing long videos but by seeing your video i get it easily
sir...iam having one doubt...which is are reflexive relation antisymmetric ?
What does mean of least element i didn't understand
Very clearly explained sir thank you so much 🎉😊
Thank you!
excellent explanation but why those effects 🙄
goat
nice!!