yo

[zenk...@gmail.com]

sup guys lol.

oh, by the way, is wikipedia wrong in saying that we don't need a base
case for strong induction? i didn't include one and the solutions have
one:

"Perhaps surprisingly, in this form of induction, it is not necessary
to prove that the proposition is true in the first case! That is
because it is vacuously true that the proposition holds in all cases
before the first case, simply because there are no cases before the
first case. Note that the proof then of the step needs to be able to
work with an empty antecedent; the first proof above is not of this
kind (but can be converted)." <- so says wikipedia

[zenk...@gmail.com]

sorry: http://en.wikipedia.org/wiki/Mathematical_induction

[Thomson!!]

http://mathcircle.berkeley.edu/BMC4/Handouts/induct/node6.html

zenk...@gmail.com wrote:
> sorry: http://en.wikipedia.org/wiki/Mathematical_induction