Prove the statement by the Principle of Mathematical Induction: $3^{2n} - 1$ is divisible by $8$ for all natural numbers $n$.

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(N/A) Let $P(n): 3^{2n} - 1$ is divisible by $8$.
Step $1$: For $n = 1$,$P(1) = 3^{2(1)} - 1 = 9 - 1 = 8$,which is divisible by $8$. Thus,$P(1)$ is true.
Step $2$: Assume $P(k)$ is true for some natural number $k$,i.e.,$3^{2k} - 1 = 8m$ for some integer $m$. This implies $3^{2k} = 8m + 1$ $(i)$.
Step $3$: For $n = k + 1$,we need to show $P(k + 1)$ is true,i.e.,$3^{2(k+1)} - 1$ is divisible by $8$.
$3^{2(k+1)} - 1 = 3^{2k+2} - 1 = 3^{2k} \cdot 3^2 - 1 = 9 \cdot 3^{2k} - 1$.
Substituting $(i)$,we get $9(8m + 1) - 1 = 72m + 9 - 1 = 72m + 8 = 8(9m + 1)$.
Since $8(9m + 1)$ is divisible by $8$,$P(k + 1)$ is true.
Hence,by the Principle of Mathematical Induction,$P(n)$ is true for all $n \in \mathbb{N}$.

Explore More

Similar Questions

For every positive integer $n,$ prove that $7^{n}-3^{n}$ is divisible by $4.$

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

Prove the statement by the Principle of Mathematical Induction: $n(n^{2}+5)$ is divisible by $6$,for each natural number $n$.

Prove the following by using the principle of mathematical induction for all $n \in N:$
$4+8+12+\ldots+4n = 2n(n+1)$

For each $n \in N$,which of the following statements is correct?

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