Happy New Year! Today we see how we may check if the "solution" to our recurrence relations are correct. We do this using mathematical induction. In our example, we can get away with weak induction, though strong induction might be helpful here sometimes!
Time Stamps:
0:00 Setup
0:45 What's the "game plan"?
1:28 Proof
11:30 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
0