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

Prove the statement by the Principle of Mathematical Induction :
$1+5+9+\ldots+(4 n-3)=n(2 n-1)$ for all natural numbers $n$.

Let $P(n) : 3^n < n!$ for $n \in N$ be true for $n \geq \lambda$. Find the smallest value of $\lambda$.

Prove that the following inequality holds for all $n \in N$ by using the principle of mathematical induction:
$(2n + 7) < (n + 3)^{2}$

Difficult
View Solution

Prove the statement by the Principle of Mathematical Induction: $1+2+2^{2}+\ldots+2^{n}=2^{n+1}-1$ for all natural numbers $n$.

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$

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