
Re: Simple versus formal proof?
Posted:
Jun 23, 2006 10:04 AM


Mohab wrote: > not so, what if you go negative? > (k1)^2 + (k1)
Factorise k^2 + k as k(k+1). Substituting k1 for k gives (k1)k, and the previous proof that since one of these is odd and the other even therefore the product is even holds. Of course this form of proof could be used to prove the theorem for all k, so it really shows up how proof by induction is unneccessary for this problem, but it would still be a valid proof by induction would it not?
Cheers,
Rossc

