Proofs by Induction

<div dir="ltr" style="text-align: left;" trbidi="on"> <span class="_Tgc">A <b>proof</b> by <b>induction</b> is just like an ordinary <b>proof</b> in which every step must be justified. However it employs a neat trick which allows you to prove a statement about an arbitrary number n by first proving it is true when n is 1 and then assuming it is true for n=k and showing it is true for n=k+1.</span><br /> <br /> <br /> <iframe allowfullscreen="" frameborder="0" height="360" src="https://www.youtube.com/embed/dMn5w4_ztSw" width="640"></iframe> <div class="separator" style="clear: both; text-align: center;"> <a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjS0QAaE5lVJlgcBsVh1uXdeNDkUEBQNjn8dEichi4P5YsfUKBUqqhsdzWswgs5s97PPC82Og0fbyP4g_bITNrOwV0RnwXPZz9Rx5z3pXOPQSCO4PwuF15IJbV1NYLoCOjP6AjrvfbaIpr6/s1600/Screenshot_4.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="640" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjS0QAaE5lVJlgcBsVh1uXdeNDkUEBQNjn8dEichi4P5YsfUKBUqqhsdzWswgs5s97PPC82Og0fbyP4g_bITNrOwV0RnwXPZz9Rx5z3pXOPQSCO4PwuF15IJbV1NYLoCOjP6AjrvfbaIpr6/s640/Screenshot_4.png" width="417" /></a></div> </div>

Proofs by Induction

A proof by induction is just like an ordinary proof in which every step must be justified. However it employs a neat trick which allow...

Read more »