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

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(N/A) Let $P(n): 7^{n}-3^{n}$ is divisible by $4$.
Step $1$: For $n=1$,$7^{1}-3^{1} = 4$,which is divisible by $4$. So,$P(1)$ is true.
Step $2$: Assume $P(m)$ is true for some $m \in N$,i.e.,$7^{m}-3^{m} = 4k$ for some integer $k$. Thus,$7^{m} = 4k + 3^{m}$.
Step $3$: For $n=m+1$,we have $7^{m+1}-3^{m+1}$.
$= 7 \cdot 7^{m} - 3 \cdot 3^{m}$
$= 7(4k + 3^{m}) - 3 \cdot 3^{m}$
$= 28k + 7 \cdot 3^{m} - 3 \cdot 3^{m}$
$= 28k + 4 \cdot 3^{m}$
$= 4(7k + 3^{m})$.
Since $4(7k + 3^{m})$ is a multiple of $4$,$P(m+1)$ is true.
By the principle of mathematical induction,$7^{n}-3^{n}$ is divisible by $4$ 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 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

For what natural numbers $n \in N$,is the inequality $2^n > n+1$ valid?

Let $S(k) = 1 + 3 + 5 + \dots + (2k - 1) = 3 + k^2$. Then which of the following is true?

Use the Principle of Mathematical Induction to prove that the number of subsets of a set containing $n$ distinct elements is $2^{n}$,for all $n \in N$.

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