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

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(N/A) We define the statement $P(n): 7^{n} - 3^{n}$ is divisible by $4.$
Step $1$: Check for $n = 1.$
$P(1): 7^{1} - 3^{1} = 4,$ which is divisible by $4.$ Thus,$P(1)$ is true.
Step $2$: Assume $P(k)$ is true for some natural number $k.$
$P(k): 7^{k} - 3^{k} = 4d$ for some integer $d \in \mathbb{N}.$
Step $3$: Prove $P(k+1)$ is true.
$7^{k+1} - 3^{k+1} = 7 \cdot 7^{k} - 3 \cdot 3^{k}$
$= 7 \cdot 7^{k} - 7 \cdot 3^{k} + 7 \cdot 3^{k} - 3 \cdot 3^{k}$
$= 7(7^{k} - 3^{k}) + (7 - 3) \cdot 3^{k}$
$= 7(4d) + 4 \cdot 3^{k}$
$= 4(7d + 3^{k})$
Since $4(7d + 3^{k})$ is a multiple of $4,$ $P(k+1)$ is true.
By the principle of mathematical induction,$7^{n} - 3^{n}$ is divisible by $4$ for every positive integer $n.$

Explore More

Similar Questions

For all natural numbers $n$,$3(5^{2n+1}) + 2^{3n+1}$ is divisible by:

For all positive integral values of $n$,${3^{2n}} - 2n + 1$ is divisible by

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

Prove the rule of exponents $(ab)^{n} = a^{n}b^{n}$ by using the principle of mathematical induction for every natural number $n$.

Prove the following by using the principle of mathematical induction for all $n \in N:$
$\frac{1}{1 \cdot 3} + \frac{1}{3 \cdot 5} + \frac{1}{5 \cdot 7} + \ldots + \frac{1}{(2n-1)(2n+1)} = \frac{n}{2n+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