I am confused with the inductive step of this very basic induction example in the book Discrete Mathematics and Its Applications:
$$1 + 2+· · ·+k = k(k + 1) / 2$$
When we apply $k+1$, the equation becomes:
$$1 + 2+· · ·+k+(k+1) = k+1(k + 1)+ 1 / 2 = (k+1)(k+2)/2$$
Now I am completely lost in the actual inductive step of the equation,
$$1 + 2+· · ·+k + (k + 1) = k(k + 1) 2 + (k + 1) = k(k + 1) + 2(k + 1) / 2 = (k + 1)(k + 2) / 2$$
As I understand it, we get
$$(k+1)(k+2)/2$$
when we substitute $k+1$ from $k$ in $k(k+1)/2$ and simplifying. How is $k(k + 1) / 2 + (k + 1)$ derived?
Can someone explain what this really means? I just simplified$ k+1(k + 1)+ 1 / 2 $to $(k+1)(k+2)/2 $it's in the book, but it suddenly becomes $k(k + 1) / 2 + (k + 1)$ and we just did the addition to turn it back to $(k+1)(k+2)/2$. How did it happen?
The kicker, here, is to assume $$1+\cdots+k=\frac{k(k+1)}{2}\tag{$\star$}$$ for some $k,$ then use it to prove that $$1+\cdots+k+(k+1)=\frac{(k+1)(k+2)}{2}.\tag{$\heartsuit$}$$ To do so, we use $(\star)$ to substitute $\frac{k(k+1)}2$ for $1+\cdots+k,$ which turns $1+\cdots+k+(k+1)$ into $$\frac{k(k+1)}2+(k+1).$$ Then, combining over a common denominator and simplifying completes the proof of $(\heartsuit),$ thus concluding the inductive portion.
As a side note, at no point are you taking a "sum of all positive integers." Rather, you are proving that an identity involving the sum of the first $n$ positive integers is correct for any given positive integer $n$.
Added: Since the OP's screen reader is unable to handle rendered MathJax, I include here a plain text version.
The kicker, here, is to assume
1+...+k=k(k+1)/2
for some k, then use it to prove that
1+...+k+(k+1)=(k+1)(k+2)/2.
To do so, we use our assumption to substitute k(k+1)/2 for 1+...+k, which turns 1+...+k+(k+1) into
k(k+1)/2+(k+1).
Then, combining over a common denominator and simplifying completes the inductive portion of the proof.