Proving 1 + 2 + 3 + … + n = n(n+1)/2 using Mathematical Induction

Channel:

PageWizard Games, Learning & Entertainment

Subscribers:

780

Published on November 9, 2022 5:00:31 PM ● Video Link: https://www.youtube.com/watch?v=SgO1yGY_JDw

Duration: 25:01

22 views

1

In today's lesson, I review and remind what the Principle of Mathematical Logic is, then we prove a closed form for the arithmetic series is correct via weak induction/mathematical induction.

Note that I am deliberately trying to make sure you write S(n) properly.

Time Stamps:
0:00 Opening, Principle of Mathematical Induction, Explanation
10:15 Construction of an induction proof
11:02 Claim being proven
11:52 Proof of claim
24:42 Closing

Have a beautiful day!

Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Patreon Supporters (Supporter Access!):
Eric R
-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:
PATREON: https://www.patreon.com/PageWizard
SUBSCRIBESTAR: https://www.subscribestar.com/drpage
PAYPAL: https://paypal.me/pagewizard

Follow also at:
FACEBOOK: https://www.facebook.com/DanielRPage
TWITTER: https://twitter.com/PageWizardGLE
QUORA: https://www.quora.com/profile/Daniel-R-Page
TWITCH: https://www.twitch.tv/pagewizard

#ComputerScience
#mathematics
#induction