This is one of the best videos on the entire internet. I loved this intuition so much. Thank you, thank you, thank you. I really enjoyed how you motivated it from a tree problem that anyone can understand and used the intuitive notion of building trees one by one to eventually formalize what induction is and what it can do for us. Wow. Thank you. I'm honored to have watched this.
This is examplar of how to build intuition on a subject. Start very basic, and _slowly_ build upwards with an example. I wish more people assumed this basic style when explaining.
If you could teach mathematics/logic teachers on how to teach concepts, that will spark interest in Mathematics/logical thinking among millions of students around the world. Another fantastic video, huge thank you from one of your fans :)
So basically , Induction can be thought of as an Recursive proof technique.n call n-1,n-1 calls n-2 ....and ultimately 2 calls 1 and then the function returns ,till n is reached . Beautiful .
I'm taking a graduate algorithms course, and we were expected to know discrete for the first week. This video was a blessing. Thank you.
This is one of the best videos on the entire internet. I loved this intuition so much. Thank you, thank you, thank you. I really enjoyed how you motivated it from a tree problem that anyone can understand and used the intuitive notion of building trees one by one to eventually formalize what induction is and what it can do for us. Wow. Thank you. I'm honored to have watched this.
"I hate windows" LOL. Thank you for the great explanation of induction. One of my students was thoroughly confused (so was I).
What a blessing, I needed just a bit more detail into this process. Thank you so much!
This is examplar of how to build intuition on a subject. Start very basic, and _slowly_ build upwards with an example. I wish more people assumed this basic style when explaining.
not me whispering multiple times "Damn, she is so cool !"
fr
If you could teach mathematics/logic teachers on how to teach concepts, that will spark interest in Mathematics/logical thinking among millions of students around the world. Another fantastic video, huge thank you from one of your fans :)
I love u for the way u proved it..
this is the best teaching bi have ever received
Excellent.
Excellent explanation this made it so simple.
so so good..well done mam
Superb explanation.
Very well explained, thanks!
This is the one of the best! 18:33
well done mademoiselle
Great video!
If one separates T into T_1 and T_2 where |V_1| > 1 and |V_2| > 1, are we invoking Strong Induction?
Good video!
Thank you!
Nice!
Amazing video thank you!
i just subscribe
So basically , Induction can be thought of as an Recursive proof technique.n call n-1,n-1 calls n-2 ....and ultimately 2 calls 1 and then the function returns ,till n is reached . Beautiful .