Mathematical Induction : Recurrence Relationships
Example 1
In this video I show you how to use mathematical induction to prove recurrence relationships
The method of induction:
Start by proving that it is true for n=1, then assume true for n=k and prove that it is true for n=k+1. If so it must be true for all positive integer values of n.
" Your site is invaluable "
Please help me to complete this project and keep it free for all to benefit from. More ...
Over 2000 videos have been completed so far and more go up most days, see my facebook page.