Prove the following by using the principle of mathematical induction for all $n \in N:$
$3^{2n} - 1$ is divisible by $8$.

Vedclass pdf generator app on play store
Vedclass iOS app on app store
Let $P(n)$ be the statement that $3^{2n} - 1$ is divisible by $8$.
Step $1$: For $n = 1$,$3^{2(1)} - 1 = 9 - 1 = 8$,which is divisible by $8$. Thus,$P(1)$ is true.
Step $2$: Assume $P(m)$ is true for some $m \in N$,i.e.,$3^{2m} - 1 = 8k$ for some integer $k$. So,$3^{2m} = 8k + 1$.
Step $3$: We need to show $P(m+1)$ is true,i.e.,$3^{2(m+1)} - 1$ is divisible by $8$.
$3^{2(m+1)} - 1 = 3^{2m} \times 3^2 - 1$
$= (8k + 1) \times 9 - 1$
$= 72k + 9 - 1$
$= 72k + 8$
$= 8(9k + 1)$.
Since $8(9k + 1)$ is divisible by $8$,$P(m+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$:
$a + ar + ar^{2} + \ldots + ar^{n-1} = \frac{a(r^{n} - 1)}{r - 1}$

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

Let $P(n) = 3^{2n+1} + 2^{n+2}$ where $n \in N$. Then

Prove that $(1 + x)^n \ge (1 + nx)$ for all natural numbers $n,$ where $x > -1.$

Difficult
View Solution

Let $P(n)$ denote the statement that $n^2 + n$ is odd. It is seen that $P(n) \Rightarrow P(n + 1)$. $P(n)$ is true for all:

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