Prove the following by using the principle of mathematical induction for all $n \in N$:
$1+\frac{1}{(1+2)}+\frac{1}{(1+2+3)}+\ldots+\frac{1}{(1+2+3+\ldots+n)}=\frac{2n}{n+1}$

(N/A) Let the given statement be $P(n)$,i.e.,
$P(n): 1+\frac{1}{1+2}+\frac{1}{1+2+3}+\ldots+\frac{1}{1+2+3+\ldots+n}=\frac{2n}{n+1}$
For $n=1$,we have
$P(1): 1=\frac{2(1)}{1+1}=\frac{2}{2}=1$,which is true.
Let $P(k)$ be true for some positive integer $k$,i.e.,
$1+\frac{1}{1+2}+\ldots+\frac{1}{1+2+3+\ldots+k}=\frac{2k}{k+1}$ .........$(i)$
We shall now prove that $P(k+1)$ is true.
Consider the sum up to $(k+1)$ terms:
$S_{k+1} = \left(1+\frac{1}{1+2}+\ldots+\frac{1}{1+2+3+\ldots+k}\right)+\frac{1}{1+2+3+\ldots+k+(k+1)}$
Using $(i)$,we get:
$S_{k+1} = \frac{2k}{k+1} + \frac{1}{\frac{(k+1)(k+2)}{2}}$ [Since $1+2+\ldots+n = \frac{n(n+1)}{2}$]
$S_{k+1} = \frac{2k}{k+1} + \frac{2}{(k+1)(k+2)}$
$S_{k+1} = \frac{2}{(k+1)} \left(k + \frac{1}{k+2}\right)$
$S_{k+1} = \frac{2}{(k+1)} \left(\frac{k^2+2k+1}{k+2}\right)$
$S_{k+1} = \frac{2}{(k+1)} \left(\frac{(k+1)^2}{k+2}\right)$
$S_{k+1} = \frac{2(k+1)}{k+2}$
Thus,$P(k+1)$ is true whenever $P(k)$ is true.
Hence,by the principle of mathematical induction,the statement $P(n)$ is true for all $n \in N$.