Let P(n) be the given statement, then by principle of mathematical induction,
P(n)=1+11+2+11+2+3+⋯+11+2+3+⋯+n=2nn+1
Let n=1,
P(1)=2×11+1
=1
So, the statement is true.
Let n=k,
P(k)=1+11+2+11+2+3+⋯+11+2+3+⋯+k=2kk+1
It is to prove that P(k+1) is true for n=k+1.
Consider,
1+11+2+11+2+3+⋯+11+2+3+⋯+k+11+2+3+⋯+k+(k+1)
=(1+11+2+11+2+3+⋯+11+2+3+⋯+k)+11+2+3+⋯+k+(k+1)
=2kk+1+11+2+3+⋯+k+(k+1)
=2kk+1+1(k+1)(k+1+1)2 (∑n=n(n+1)2)
=2kk+1+2(k+1)(k+1+1)
=2kk+1(k+1k+2)
=2kk+1(k2+2k+1k+2)
=2(k+1)2(k+1)(k+2)
=2(k+1)k+2
=2nn+1
This shows that P(k+1) is true when P(k) is true.
Hence, P(n) is true for all natural numbers.