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 nN
(1+31)(1+54)(1+79)(1+(2n+1)n2)=(n+1)2

Open in App
Solution

Step (1): Assume given statement
Let the given statement be P(n) i.e.
P(n):(1+31)(1+54)(1+79)(1+(2n+1)n2)=(n+1)2

Step (2): Checking statement P(n) for n=1
Put n=1 in P(n), we get
P(1):(1+31)=(1+1)2
4=4
Thus P(n) is true for n=1

Step (3): P(n) for n=K
Put n=K in P(n) and assume this is true for some natural number K i.e.,
P(K):(1+31)(1+54)(1+79)(1+(2K+1)K2)=(K+1)2 (1)

Step (4): Checking statement P(n) for n=K+1
Now we shall prove that P(K+1) is true whenever P(K) is true.
Now we have
(1+31)(1+54)(1+79)(1+(2K+1)K2)(1+(2K+3)(K+1)2)
=(K+1)2[1+(2K+3)(K+1)2] (using(1))
=(K+1)2[(K+1)2+(2K+3)(K+1)2]
=K2+2K+1+2K+3
=K2+4K+4
=(K+2)2
We can write it as [(K+1)+1]2
Thus, P(K+1) is true whether P(K) is true.
Final Answer:
Therefore, by the principle of mathematical induction, statement P(n) is true for all nN .

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
Join BYJU'S Learning Program
CrossIcon