Prove the following by using the principle of mathematical induction for all $n \in N:$
$4+8+12+\ldots+4n = 2n(n+1)$

Vedclass pdf generator app on play store
Vedclass iOS app on app store
Let $P(n)$ be the statement $4+8+12+\ldots+4n = 2n(n+1)$.
Step $1$: For $n=1$,the left-hand side is $4(1) = 4$ and the right-hand side is $2(1)(1+1) = 2(2) = 4$.
Since $4=4$,$P(1)$ is true.
Step $2$: Assume $P(k)$ is true for some $k \in N$,i.e.,$4+8+12+\ldots+4k = 2k(k+1)$.
Step $3$: We need to show $P(k+1)$ is true,i.e.,$4+8+12+\ldots+4k+4(k+1) = 2(k+1)(k+2)$.
Starting with the left-hand side:
$(4+8+12+\ldots+4k) + 4(k+1) = 2k(k+1) + 4(k+1)$
$= 2k^2 + 2k + 4k + 4$
$= 2k^2 + 6k + 4$
$= 2(k^2 + 3k + 2)$
$= 2(k+1)(k+2)$.
This matches the right-hand side for $n=k+1$.
Thus,by the principle of mathematical induction,$P(n)$ is true for all $n \in N$.

Explore More

Similar Questions

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

Prove the following by using the principle of mathematical induction for all $n \in N$ :
$1^{3}+2^{3}+3^{3}+\ldots+n^{3}=\left(\frac{n(n+1)}{2}\right)^{2}$

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:

Prove the statement by the Principle of Mathematical Induction: $2+4+6+\ldots+2n = n^2+n$ for all natural numbers $n$.

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

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