CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Prove the following by using the principle of mathematical induction for all n:
1+1(1+2)+1(1+2+3)+..........+11+2+3+.....n)=2n(n+1)

Open in App
Solution

Let the given statement be P(n) i.e.,
P(n):
For n=1, we have
P(1):1=2×11+1=22=1
which is true.
Let P(k) be true for some kN,
1+11+2+......11+2+3+......+11+2+3+.....+k=2kk+1.........(i)
We shall now prove that P(k+1) is true.
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) [Using (i)]
=2kk+1+1((k+1)(k+1+1)2) (1+2+3+.....+n=n(n+1)2)
=2k(k+1)+2(k+1)(k+2)
=2(k+1)(k+1k+2)
=2(k2+2k+1)(k+1)(k+2)
=2(k+1)k+2
Hence, the given result is true for k+1.
So, by mathematical induction method, the given result is true for all nN

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Mathematical Induction
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon