Problems Plus Example 4 - Mathematical Induction

avatar

In this video I go through another problems plus example which in this case is on Mathematical Induction. I also go over mathematical induction is and use the tough problems plus example to illustrate it further. The principle of mathematical induction is pretty straight forward but the wording of it can be a bit tricky. Basically it states that if your function is true for n = 1, and it's true for k+1 if at k is true then it is true for all positive integers n. Since n = 1 is true, it follows that n = 2 is true and thus n = 3 and so on forever.


Watch video on:

Download video notes: https://1drv.ms/b/s!As32ynv0LoaIiN5VBY617a7dgkeIKg?e=ji1JeY


View Video Notes Below!


Download these notes: Link is in video description.
View these notes as an article: https://peakd.com/@mes
Subscribe via email: http://mes.fm/subscribe
Donate! :) https://mes.fm/donate
Buy MES merchandise! https://mes.fm/store

Reuse of my videos:

  • Feel free to make use of / re-upload / monetize my videos as long as you provide a link to the original video.

Fight back against censorship:

  • Bookmark sites/channels/accounts and check periodically
  • Remember to always archive website pages in case they get deleted/changed.

Buy "Where Did The Towers Go?" by Dr. Judy Wood: https://mes.fm/judywoodbook
Subscribe to MES Truth: https://mes.fm/truth

Join my forums!

Follow along my epic video series:


NOTE #1: If you don't have time to watch this whole video:

Browser extension recommendations:


Problems Plus – Example 4 – Mathematical Induction

Problems Plus Example 4.jpg

Principle of Mathematical Induction

Let Sn be a statement about the positive integer n.

Suppose that:

  1. S1 is true.
  2. Sk+1 is true whenever Sk is true.

Thus Sn is true for all positive integers n.

image.png

Example

image.png

Solution

image.png

image.png

image.png

image.png

image.png

image.png

image.png



0
0
0.000