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 rule of exponents $(ab)^{n} = a^{n}b^{n}$ by using the principle of mathematical induction for every natural number $n$.
Medium
View SolutionIf $P(n) = 2 + 4 + 6 + \dots + 2n$,$n \in N$,then $P(k) = k(k + 1) + 2 \implies P(k + 1) = (k + 1)(k + 2) + 2$ for all $k \in N$. So we can conclude that $P(k) = k(k + 1) + 2$ for all $k \in N$ is true. What can we conclude about $P(n) = n(n + 1) + 2$ for all $n \in N$?
Easy
View SolutionConsider the statement: $P(n): n^2 - n + 41$ is prime. Then which one of the following is true?
DifficultJEE MAIN 2019
View SolutionProve the statement by the Principle of Mathematical Induction: $2+4+6+\ldots+2n = n^2+n$ for all natural numbers $n$.
Medium
View SolutionFor all $n \ge 1,$ prove that $1^{2}+2^{2}+3^{2}+4^{2}+\ldots+n^{2}=\frac{n(n+1)(2 n+1)}{6}$
Medium
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