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

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(N/A) Let the given statement be $P(n)$,i.e.,
$P(n): 1 \cdot 3 + 3 \cdot 5 + 5 \cdot 7 + \ldots + (2n - 1)(2n + 1) = \frac{n(4n^2 + 6n - 1)}{3}$
For $n = 1$,we have
$P(1): 1 \cdot 3 = 3 = \frac{1(4(1)^2 + 6(1) - 1)}{3} = \frac{4 + 6 - 1}{3} = \frac{9}{3} = 3$,which is true.
Assume $P(k)$ is true for some positive integer $k$,i.e.,
$1 \cdot 3 + 3 \cdot 5 + 5 \cdot 7 + \ldots + (2k - 1)(2k + 1) = \frac{k(4k^2 + 6k - 1)}{3}$ $(i)$
We shall now prove that $P(k + 1)$ is true.
Consider the sum up to $(k + 1)$ terms:
$(1 \cdot 3 + 3 \cdot 5 + \ldots + (2k - 1)(2k + 1)) + (2(k + 1) - 1)(2(k + 1) + 1)$
$= \frac{k(4k^2 + 6k - 1)}{3} + (2k + 1)(2k + 3)$ [Using $(i)$]
$= \frac{4k^3 + 6k^2 - k + 3(4k^2 + 8k + 3)}{3}$
$= \frac{4k^3 + 6k^2 - k + 12k^2 + 24k + 9}{3}$
$= \frac{4k^3 + 18k^2 + 23k + 9}{3}$
$= \frac{(k + 1)(4(k + 1)^2 + 6(k + 1) - 1)}{3}$
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

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

Use 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)}$

Difficult
View Solution

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 the following by using the principle of mathematical induction for all $n \in N$:
$\frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\ldots+\frac{1}{2^{n}}=1-\frac{1}{2^{n}}$

For every positive integer $n$,${2^n} < n!$ when

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