Prove using induction that the sum of the first step $n$ positive even integers is $n(n+1)$. In other words, prove using induction that $2 + 4 + 6 + … + 2n = n(n+1)$.
So, for my base case I have: the statement is true for $n=2$ as the sum of the first positive integer is $1(1+1) = 2$.
I don't know if this is right, and I am lost on what to do for the inductive step.