Induction Proof using factorials Recall that for $n \in N$, $n! = 1 \cdot 2 \cdots n$.
Prove the following for each $n \in N$:
$$\frac{1}{2!} + \frac{2}{3!} + \frac{3}{4!} + \cdots + \frac{n}{(n+1)!} = 1 - \frac{1}{(n+1)!}$$
I understand how to do the proof, but in the inductive step I am facing some difficulty proving the left-hand side is equivalent to the right-hand side.To be direct I am facing some difficulty with the algebra required to make LHS = RHS.
Here is what I have done so far:
1) Base Case
$n = 1$
LHS:
$1/2$
and RHS is $1/2$ $\checkmark$
2) Inductive Step
For $k \geq 1$, Assume $n = k$
$$\frac{1}{2!} + \frac{2}{3!} + \frac{3}{4!} + \cdots + \frac{k}{(k+1)!} = 1 - \frac{1}{(k+1)!}$$
$$n = k + 1$$
$$\frac{1}{2!} + \frac{2}{3!} + \frac{3}{4!} + \cdots + \frac{n}{(n+1)!} + \frac{k+1}{(k+2)!} = 1 - \frac{1}{(n+1)!}$$
$$\implies 1-\frac{1}{(k+1)!} + \frac{k+1}{(k+2)!} = 1 - \frac{1}{(k+2)!}$$
Here is  where i do not know how to make the LHS = RHS.

For $n=1,2,3$ we have:
\begin{eqnarray}
\frac{1}{2!}&=&\frac12=1-\frac12=1-\frac{1}{2!}\\
\frac{1}{2!}+\frac{2}{3!}&=&1-\frac{1}{2!}+\frac13=1-\frac16=1-\frac{1}{3!}\\
\frac{1}{2!}+\frac{2}{3!}+\frac{3}{4!}&=&1-\frac16+\frac{1}{8}=1-\frac{1}{24}=1-\frac{1}{4!}.
\end{eqnarray}
If we assume that up to $n=3$, we have
$$
\sum_{k=1}^n\frac{k}{(k+1)!}=1-\frac{1}{(n+1)!}.
$$
Then
\begin{eqnarray}
\sum_{k=1}^{n+1}\frac{k}{(k+1)!}&=&\sum_{k=1}^n\frac{k}{(k+1)!}+\frac{n+1}{(n+2)!}=1-\frac{1}{(n+1)!}+\frac{n+1}{(n+2)!}\\
&=&1-\frac{n+2-(n+1)}{(n+2)!}=1-\frac{1}{(n+2)!}.
\end{eqnarray}
