06-29-2013, 04:36 AM
(This post was last modified: 06-29-2013, 04:48 AM by fl3tching101.)
(06-29-2013, 01:40 AM)Guy1234567890 Wrote: Just as a note, you only have to show that the proposition is true for one case (usually the case where n is the smallest) and then you can immediately show that it is true for the k+1th case.
Yea, I saw that on the wiki, but we were taught to show true for the three cases. Also we were taught to make a middle step that was just replacing n with k lol... I quite hate Mathematical Induction so

Lol when I posted this I really didn't expect such discussion

