Use induction to prove that 2 + 4 + 6 + ... + 2n = n2 + n for n
≥ 1.
Prove this theorem as it is given, i.e., don’t first simplify it
algebraically to some other formula that you may recognize before
starting the induction proof.
I'd appreciate if you could label the steps you take, Thank
you!