Discrete Math II/Combinatorics (Entire course) - 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: https://bellevueuniversity-my.sharepoint.com/:f:/g/personal/kbrehm_bellevue_edu/Ei9DcmrOBTlAuMxWUoq9ZqsB14M60jcpob-xdAYS6ruVWw?e=uP9KN0 The entire playlist can be found here: https://www.youtube.com/playlist?list=PLl-gb0E4MII0sGLCJeqDB3y63HZ6lM5LJ