Prove the following by using the principle of mathematical induction for all $n \in N$:
$\frac{1}{2 \times 5} + \frac{1}{5 \times 8} + \frac{1}{8 \times 11} + \ldots + \frac{1}{(3n-1)(3n+2)} = \frac{n}{6n+4}$

Vedclass pdf generator app on play store
Vedclass iOS app on app store
Let the given statement be $P(n)$,i.e.,
$P(n): \frac{1}{2 \times 5} + \frac{1}{5 \times 8} + \frac{1}{8 \times 11} + \ldots + \frac{1}{(3n-1)(3n+2)} = \frac{n}{6n+4}$
For $n=1$,we have
$P(1): \frac{1}{2 \times 5} = \frac{1}{10} = \frac{1}{6(1)+4} = \frac{1}{10}$,which is true.
Assume $P(k)$ is true for some positive integer $k$,i.e.,
$P(k): \frac{1}{2 \times 5} + \frac{1}{5 \times 8} + \ldots + \frac{1}{(3k-1)(3k+2)} = \frac{k}{6k+4}$ ..........$(i)$
We shall now prove that $P(k+1)$ is true.
Consider the sum up to $(k+1)$ terms:
$\frac{1}{2 \times 5} + \ldots + \frac{1}{(3k-1)(3k+2)} + \frac{1}{\{3(k+1)-1\}\{3(k+1)+2\}}$
$= \frac{k}{6k+4} + \frac{1}{(3k+2)(3k+5)}$ [Using $(i)$]
$= \frac{k}{2(3k+2)} + \frac{1}{(3k+2)(3k+5)}$
$= \frac{1}{3k+2} \left( \frac{k}{2} + \frac{1}{3k+5} \right)$
$= \frac{1}{3k+2} \left( \frac{k(3k+5) + 2}{2(3k+5)} \right)$
$= \frac{1}{3k+2} \left( \frac{3k^2 + 5k + 2}{2(3k+5)} \right)$
$= \frac{1}{3k+2} \left( \frac{(3k+2)(k+1)}{2(3k+5)} \right)$
$= \frac{k+1}{2(3k+5)} = \frac{k+1}{6k+10}$
$= \frac{k+1}{6(k+1)+4}$
Thus,$P(k+1)$ is true whenever $P(k)$ is true.
Hence,by the principle of mathematical induction,the statement $P(n)$ is true for all $n \in N$.

Explore More

Similar Questions

For every natural number $n$,which of the following inequalities is true?

Prove the following by using the principle of mathematical induction for all $n \in N$:
$1 \cdot 3 + 2 \cdot 3^{2} + 3 \cdot 3^{3} + \ldots + n \cdot 3^{n} = \frac{(2n - 1) 3^{n+1} + 3}{4}$

Difficult
View Solution

Prove that for all $n \in N$,$41^{n}-14^{n}$ is a multiple of $27$ using the principle of mathematical induction.

Difficult
View Solution

Prove the following by using the principle of mathematical induction for all $n \in N$:
$\left(1+\frac{1}{1}\right)\left(1+\frac{1}{2}\right)\left(1+\frac{1}{3}\right) \dots\left(1+\frac{1}{n}\right)=(n+1)$

Prove that the following is true for all $n \in N$ using the principle of mathematical induction:
$n(n+1)(n+5)$ is a multiple of $3.$

Difficult
View Solution

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo