wiz-icon
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 ∈ N: 1.2.3 + 2.3.4 + … + n(n + 1) (n + 2) =

Open in App
Solution

Let the given statement be P(n), i.e.,

P(n): 1.2.3 + 2.3.4 + … + n(n + 1) (n + 2) =

For n = 1, we have

P(1): 1.2.3 = 6 =, which is true.

Let P(k) be true for some positive integer k, i.e.,

1.2.3 + 2.3.4 + … + k(k + 1) (k + 2)

We shall now prove that P(k + 1) is true.

Consider

1.2.3 + 2.3.4 + … + k(k + 1) (k + 2) + (k + 1) (k + 2) (k + 3)

= {1.2.3 + 2.3.4 + … + k(k + 1) (k + 2)} + (k + 1) (k + 2) (k + 3)


Thus, P(k + 1) is true whenever P(k) is true.

Hence, by the principle of mathematical induction, statement P(n) is true for all natural numbers i.e., n.


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