Give an Inductive Proof that n^2 + n is even for all integers n >= 1
Thank you kindly.
Of course you don't need an inductive proof to show the result, but I gave an inductive proof since you asked for it. It is obvious that the expression is always even because it is the same as n(n+1) which, trivially, is always even for integer n.
