If you have any questions on things covered in this video, post them here: codeforces.com/blog/entry/78830 and I should be able to explain whatever is confusing.
Hey, this was really helpful! Please make more videos if you get the time, there really is a dearth of top coders who are fluent in English and can express stuff easily:)
Thank god, this isn't my first video when learning modular arithmetic. I would've loathed modular arithmetic then. Teaching algorithms in a way that makes them dead instead of interesting is a nice idea for a channel. Kudos! Coming to the point, you didn't even mention what modular inverse means. Like it is simply x*x^(-1) =1 but how would I know about it before getting bombarded with Fermat's theorum? You should define something first before using it. I was midway through the video when I lost you. You should instead timestamp the video so that I don't have to watch what a+b%m means....
A really good video David!!Its nice to see how the modular division works under the hood.There’s one video from Khan Academy which explains Fermats little theorem really well,visually.Watched that a couple of years back.For anyone wishing to watch that,I have posted the link below. www.khanacademy.org/computing/computer-science/cryptography/random-algorithms-probability/v/fermat-s-little-theorem-visualization
If you have any questions on things covered in this video, post them here: codeforces.com/blog/entry/78830 and I should be able to explain whatever is confusing.
Hey, this was really helpful! Please make more videos if you get the time, there really is a dearth of top coders who are fluent in English and can express stuff easily:)
You are very good at communicating your thoughts in a very intuitive way. Thanks for this!
Recently discovered your channel, superb video.
I just want to say, thanks for providing this exceptional content.
Smooth Second Thread Bhai...smootth. Thank you!
Thank you, great explanations.
this is very much helpful!.keep doing the good work
great video dude
Thanks
nice content, youtube definitely needs more high quality algorithms content, keep it up, thank you
Very helpful
By the way sound is very impressive 😍😍😍
Great work !!
thank's so much ,please continue
wow that was amazing!!! would love if you can make similar topicwise videos for graphs as well :)
Thankyou very much ❤️
TY
Which pen are you using to write? If there's a link then please do share it, thanks
Did Sheldon get bored of Physics?
probablity cant be greater than 1 at 23:52
Oh C'mon man!
He is just trying to explain the concept.
That's not probability in the first place. It's called Expected Value of some event to happen (which can literally take any value ).
Thank god, this isn't my first video when learning modular arithmetic. I would've loathed modular arithmetic then. Teaching algorithms in a way that makes them dead instead of interesting is a nice idea for a channel. Kudos!
Coming to the point, you didn't even mention what modular inverse means. Like it is simply x*x^(-1) =1 but how would I know about it before getting bombarded with Fermat's theorum?
You should define something first before using it. I was midway through the video when I lost you. You should instead timestamp the video so that I don't have to watch what a+b%m means....
the content is cool but your face was coming in between the equations..please either shorten the size of your webcam or just remove it. cheers!
A really good video David!!Its nice to see how the modular division works under the hood.There’s one video from Khan Academy which explains Fermats little theorem really well,visually.Watched that a couple of years back.For anyone wishing to watch that,I have posted the link below.
www.khanacademy.org/computing/computer-science/cryptography/random-algorithms-probability/v/fermat-s-little-theorem-visualization