Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that: ∑t=1n-1t(t+1)=n(n-1)(n+1)3, for all natural numbers n ≥ 2.

Question

Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:

`sum_(t = 1)^(n - 1) t(t + 1) = (n(n - 1)(n + 1))/3`, for all natural numbers n ≥ 2.

Sum

Solution

Let the given statement P(n), be given as

P(n) : `sum_(t = 1)^(n - 1) t(t + 1) = (n(n - 1)(n + 1))/3`, for all natural numbers n ≥ 2

We observe that

P(2) : `sum_(t = 1)^(2 - 1) t(t + 1) = sum_(t = 1)^1 t(t + 1)`

= 1.2

= `(1.2.3)/3`

= `(2.(2 - 1)(2 + 1))/3`

Thus, P(n) in true for n = 2.

Assume that P(n) is true for n = k ∈ N.

i.e., P(k) : `sum_(t = 1)^(k - 1) t(t + 1) = (k(k - 1)(k + 1))/3`

To prove that P(k + 1) is true

We have `sum_("t" = 1)^(("k" + 1 - 1)) "t"("t" + 1) = sum_("t" = 1)^"k" "t"("t" + 1)`

= `sum_("t" = 1)^(k - 1) t(t + 1) + k(k + 1)`

= `(k(k - 1)(k + 1))/3 + k(k + 1)`

= `k(k + 1)[(k - 1 + 3)/3]`

= `(k(k + 1)(k + 2))/3`

= `((k + 1)((k + 1) - 1)((k + 1) + 1))/3`

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

Hence, by the Principle of Mathematical Induction, P(n) is true for all natural numbers n ≥ 2.

shaalaa.com

Principle of Mathematical Induction

Is there an error in this question or solution?

Q 2 Q 1 Q 3

Chapter 4: Principle of Mathematical Induction - Solved Examples [Page 62]

APPEARS IN

NCERT Exemplar Mathematics [English] Class 11

Chapter 4 Principle of Mathematical Induction
Solved Examples | Q 2 | Page 62

Video TutorialsVIEW ALL [1]

view
Video Tutorials For All Subjects
Principle of Mathematical Induction

video tutorial00:17:42

RELATED QUESTIONS

Prove the following by using the principle of mathematical induction for all n ∈ N:

(1+3/1)(1+ 5/4)(1+7/9)...`(1 + ((2n + 1))/n^2) = (n + 1)^2`

Prove the following by using the principle of mathematical induction for all n ∈ N:

`1^2 + 3^2 + 5^2 + ... + (2n -1)^2 = (n(2n - 1) (2n + 1))/3`

Prove the following by using the principle of mathematical induction for all n ∈ N:

`1/1.4 + 1/4.7 + 1/7.10 + ... + 1/((3n - 2)(3n + 1)) = n/((3n + 1))`

Given an example of a statement P (n) such that it is true for all n ∈ N.

Give an example of a statement P(n) which is true for all n ≥ 4 but P(1), P(2) and P(3) are not true. Justify your answer.

\[\frac{1}{1 . 4} + \frac{1}{4 . 7} + \frac{1}{7 . 10} + . . . + \frac{1}{(3n - 2)(3n + 1)} = \frac{n}{3n + 1}\]

\[\frac{1}{3 . 5} + \frac{1}{5 . 7} + \frac{1}{7 . 9} + . . . + \frac{1}{(2n + 1)(2n + 3)} = \frac{n}{3(2n + 3)}\]

\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 5} + . . . + \frac{1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\]

1.2 + 2.2² + 3.2³ + ... + n.2ⁿ= (n − 1) 2ⁿ⁺¹+2

1.3 + 2.4 + 3.5 + ... + n. (n + 2) = \[\frac{1}{6}n(n + 1)(2n + 7)\]

1² + 3² + 5² + ... + (2n − 1)² = \[\frac{1}{3}n(4 n^2 - 1)\]

a + ar + ar² + ... + arⁿ⁻¹ = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]

(ab)ⁿ = aⁿbⁿ for all n ∈ N.

7²ⁿ + 2³ⁿ⁻³. 3ⁿ⁻¹ is divisible by 25 for all n ∈ N.

2.7ⁿ + 3.5ⁿ − 5 is divisible by 24 for all n ∈ N.

Prove that 1 + 2 + 2² + ... + 2ⁿ = 2ⁿ⁺¹ - 1 for all n \[\in\] N .

\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\] for all n ∈ N .

\[\sin x + \sin 3x + . . . + \sin (2n - 1)x = \frac{\sin^2 nx}{\sin x}\]

\[\text{ Prove that } \cos\alpha + \cos\left( \alpha + \beta \right) + \cos\left( \alpha + 2\beta \right) + . . . + \cos\left[ \alpha + \left( n - 1 \right)\beta \right] = \frac{\cos\left\{ \alpha + \left( \frac{n - 1}{2} \right)\beta \right\}\sin\left( \frac{n\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)} \text{ for all n } \in N .\]

\[\text{ Using principle of mathematical induction, prove that } \sqrt{n} < \frac{1}{\sqrt{1}} + \frac{1}{\sqrt{2}} + \frac{1}{\sqrt{3}} + . . . + \frac{1}{\sqrt{n}} \text{ for all natural numbers } n \geq 2 .\]