Discrete Math II - 5.1.2 Practice Proofs by Mathematical Induction

Though we studied proof by induction in Discrete Math I, I will take you through the topic as though you haven't learned it in the past. The premise is that we prove the statement or conjecture is true for the least element in the set, then show that if the statement is true for the kth element, it is true for the (k+1)th element. We will go through just one example and show the steps used for a proper proof. The follow-up video for section 5.1 is all practice proofs.
Video Chapters:
Intro 0:00
Reminder of Summation Formulas 0:10
Prove the summation of i is n(n+1)/2 0:34
Prove the summation of 1/i(i+1)=n/(n+1) 5:34
Conjecture and prove summation formula for 1/2^n 11:41
Up Next 18:07
This playlist uses Discrete Mathematics and Its Applications, Rosen 8e
Power Point slide decks to accompany the videos can be found here:
bellevueuniversity-my.sharepo...
The entire playlist can be found here:
• Discrete Math II/Combi...

[@chetissweet]

Thank you SO much Kimberley. I am taking a discrete math course as a prerequisite for master's coursework and this video has singlehandedly relieved me of a lot of stress before tomorrow's mid semester exam!

[@cristoballsc]

thank u kim. made me understand this in like 45 minutes. my professor couldn't properly explain it in two lessons. i very much appreciate this... we're doing the exact same examples in a discrete math I course, hah

[@King_Baldwin_IV_777]

Thank you ma'am !

[@simi490]

I don't know who you are, but you are saving my entire academic future right now🥲. So, thank you