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

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(N/A) Let $P(n): n^{3}-7n+3$ be divisible by $3$ for all $n \in N$.
Step $1$: For $n=1$,$P(1) = (1)^{3}-7(1)+3 = 1-7+3 = -3$.
Since $-3$ is divisible by $3$,$P(1)$ is true.
Step $2$: Assume $P(k)$ is true for some $k \in N$,i.e.,$k^{3}-7k+3 = 3m$ for some integer $m$.
Step $3$: We need to show $P(k+1)$ is true.
$P(k+1) = (k+1)^{3}-7(k+1)+3$
$= (k^{3}+3k^{2}+3k+1) - 7k - 7 + 3$
$= (k^{3}-7k+3) + 3k^{2}+3k-6$
$= 3m + 3(k^{2}+k-2)$
$= 3(m+k^{2}+k-2)$.
Since $3(m+k^{2}+k-2)$ is divisible by $3$,$P(k+1)$ is true.
Thus,by the Principle of Mathematical Induction,$P(n)$ is true for all $n \in N$.

Explore More

Similar Questions

Using mathematical induction,the numbers $a_n$ are defined by:
$a_0 = 1, a_{n+1} = 3n^2 + n + a_n, (n \geq 0)$.
Then,$a_n$ is equal to:

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

If $P(n) = 2 + 4 + 6 + \dots + 2n$,$n \in N$,then $P(k) = k(k + 1) + 2 \implies P(k + 1) = (k + 1)(k + 2) + 2$ for all $k \in N$. So we can conclude that $P(k) = k(k + 1) + 2$ for all $k \in N$ is true. What can we conclude about $P(n) = n(n + 1) + 2$ for all $n \in N$?

Prove that $1^{2} + 2^{2} + \ldots + n^{2} > \frac{n^{3}}{3}$ for all $n \in N$.

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

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