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}$

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(N/A) Let the given statement be $P(n)$,i.e.,
$P(n): a + ar + ar^{2} + \ldots + ar^{n-1} = \frac{a(r^{n} - 1)}{r - 1}$
For $n = 1$,we have
$P(1): a = \frac{a(r^{1} - 1)}{r - 1} = a$,which is true.
Let $P(k)$ be true for some positive integer $k$,i.e.,
$a + ar + ar^{2} + \ldots + ar^{k-1} = \frac{a(r^{k} - 1)}{r - 1}$ $(i)$
We shall now prove that $P(k+1)$ is true.
Consider the sum of the first $(k+1)$ terms:
$(a + ar + ar^{2} + \ldots + ar^{k-1}) + ar^{(k+1)-1}$
$= \frac{a(r^{k} - 1)}{r - 1} + ar^{k}$ [Using $(i)$]
$= \frac{a(r^{k} - 1) + ar^{k}(r - 1)}{r - 1}$
$= \frac{ar^{k} - a + ar^{k+1} - ar^{k}}{r - 1}$
$= \frac{ar^{k+1} - a}{r - 1}$
$= \frac{a(r^{k+1} - 1)}{r - 1}$
Thus,$P(k+1)$ is true whenever $P(k)$ is true.
Hence,by the principle of mathematical induction,the statement $P(n)$ is true for all natural numbers $n \in N$.

Explore More

Similar Questions

For all $n \in N$,$2^{2n+1} + 3^{2n+1}$ is divisible by

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

Difficult
View Solution

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

Prove the statement by the Principle of Mathematical Induction: $n^{2} < 2^{n}$ for all natural numbers $n \geq 5$.

Difficult
View Solution

The statement $P(n): 1 \times 1! + 2 \times 2! + 3 \times 3! + \dots + n \times n! = (n + 1)! - 1$ is

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