Prove the following by using the principle of mathematical induction for all $n \in N:$
$3 \times 6 + 6 \times 9 + 9 \times 12 + \ldots + (3n)(3n + 3) = 3n(n + 1)(n + 2)$
$3 \times 6 + 6 \times 9 + 9 \times 12 + \ldots + (3n)(3n + 3) = 3n(n + 1)(n + 2)$
(N/A) Let $P(n)$ be the statement: $3 \times 6 + 6 \times 9 + 9 \times 12 + \ldots + (3n)(3n + 3) = 3n(n + 1)(n + 2)$.
Step $1$: For $n = 1$,the $LHS$ is $3 \times 6 = 18$. The $RHS$ is $3(1)(1 + 1)(1 + 2) = 3 \times 2 \times 3 = 18$. Since $LHS$ = $RHS$,$P(1)$ is true.
Step $2$: Assume $P(k)$ is true for some $k \in N$,i.e.,$3 \times 6 + 6 \times 9 + \ldots + (3k)(3k + 3) = 3k(k + 1)(k + 2)$.
Step $3$: We need to show $P(k + 1)$ is true,i.e.,$3 \times 6 + \ldots + (3k)(3k + 3) + (3(k + 1))(3(k + 1) + 3) = 3(k + 1)(k + 2)(k + 3)$.
Adding $(3(k + 1))(3(k + 1) + 3)$ to both sides of the assumption:
$LHS$ = $3k(k + 1)(k + 2) + (3k + 3)(3k + 6)$
= $3k(k + 1)(k + 2) + 3(k + 1) \times 3(k + 2)$
= $3(k + 1)(k + 2) [k + 3]$
= $3(k + 1)(k + 2)(k + 3)$.
Thus,$P(k + 1)$ is true. By the principle of mathematical induction,$P(n)$ is true for all $n \in N$.
Step $1$: For $n = 1$,the $LHS$ is $3 \times 6 = 18$. The $RHS$ is $3(1)(1 + 1)(1 + 2) = 3 \times 2 \times 3 = 18$. Since $LHS$ = $RHS$,$P(1)$ is true.
Step $2$: Assume $P(k)$ is true for some $k \in N$,i.e.,$3 \times 6 + 6 \times 9 + \ldots + (3k)(3k + 3) = 3k(k + 1)(k + 2)$.
Step $3$: We need to show $P(k + 1)$ is true,i.e.,$3 \times 6 + \ldots + (3k)(3k + 3) + (3(k + 1))(3(k + 1) + 3) = 3(k + 1)(k + 2)(k + 3)$.
Adding $(3(k + 1))(3(k + 1) + 3)$ to both sides of the assumption:
$LHS$ = $3k(k + 1)(k + 2) + (3k + 3)(3k + 6)$
= $3k(k + 1)(k + 2) + 3(k + 1) \times 3(k + 2)$
= $3(k + 1)(k + 2) [k + 3]$
= $3(k + 1)(k + 2)(k + 3)$.
Thus,$P(k + 1)$ is true. By the principle of mathematical induction,$P(n)$ is true for all $n \in N$.
Explore More
Similar Questions
Prove the following by using the principle of mathematical induction for all $n \in N:$
$1+2+2^{2}+\ldots+2^{n}=2^{n+1}-1$
$1+2+2^{2}+\ldots+2^{n}=2^{n+1}-1$
Medium
View SolutionUse the Principle of Mathematical Induction to prove that for all $n \in N$:
$\cos \alpha + \cos (\alpha + \beta) + \cos (\alpha + 2\beta) + \ldots + \cos [\alpha + (n-1)\beta] = \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)}$
$\cos \alpha + \cos (\alpha + \beta) + \cos (\alpha + 2\beta) + \ldots + \cos [\alpha + (n-1)\beta] = \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)}$
Difficult
View SolutionUse the Principle of Mathematical Induction to show that for a sequence $b_{0}, b_{1}, b_{2}, \ldots$ defined by $b_{0}=5$ and $b_{k}=4+b_{k-1}$ for all natural numbers $k$,the general term is $b_{n}=5+4n$ for all natural numbers $n$.
Difficult
View SolutionIf $P(n): 2^{n} < n!$,then the smallest positive integer $n$ for which $P(n)$ is true is:
The values of the natural numbers $n$ for which the inequality $2^n > 2n + 1$ is valid are:
Easy
View SolutionVedclass Products
For Students
Vedclass Test Series
Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.
Start Free TrialFor Teachers
Exam Paper Generator
Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.
Try FreeFor Institutes
Online Exam Module
Live online exams with unlimited students, 360° analytics & white-label branding.
See Demo