Prove the following by using the principle of mathematical induction for all $n \in N$:
$\frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\ldots+\frac{1}{2^{n}}=1-\frac{1}{2^{n}}$
$\frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\ldots+\frac{1}{2^{n}}=1-\frac{1}{2^{n}}$
Let the given statement be $P(n)$,i.e.,
$P(n): \frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\ldots+\frac{1}{2^{n}}=1-\frac{1}{2^{n}}$
For $n=1$,we have
$P(1): \frac{1}{2}=1-\frac{1}{2^{1}}=\frac{1}{2}$,which is true.
Let $P(k)$ be true for some positive integer $k$,i.e.,
$\frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\ldots+\frac{1}{2^{k}}=1-\frac{1}{2^{k}}$ $(i)$
We shall now prove that $P(k+1)$ is true.
Consider
$\left(\frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\ldots+\frac{1}{2^{k}}\right)+\frac{1}{2^{k+1}}$
$= \left(1-\frac{1}{2^{k}}\right)+\frac{1}{2^{k+1}}$ [Using $(i)$]
$= 1 - \frac{1}{2^{k}} + \frac{1}{2^{k+1}}$
$= 1 - \left(\frac{2}{2^{k+1}} - \frac{1}{2^{k+1}}\right)$
$= 1 - \frac{1}{2^{k+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$.
$P(n): \frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\ldots+\frac{1}{2^{n}}=1-\frac{1}{2^{n}}$
For $n=1$,we have
$P(1): \frac{1}{2}=1-\frac{1}{2^{1}}=\frac{1}{2}$,which is true.
Let $P(k)$ be true for some positive integer $k$,i.e.,
$\frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\ldots+\frac{1}{2^{k}}=1-\frac{1}{2^{k}}$ $(i)$
We shall now prove that $P(k+1)$ is true.
Consider
$\left(\frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\ldots+\frac{1}{2^{k}}\right)+\frac{1}{2^{k+1}}$
$= \left(1-\frac{1}{2^{k}}\right)+\frac{1}{2^{k+1}}$ [Using $(i)$]
$= 1 - \frac{1}{2^{k}} + \frac{1}{2^{k+1}}$
$= 1 - \left(\frac{2}{2^{k+1}} - \frac{1}{2^{k+1}}\right)$
$= 1 - \frac{1}{2^{k+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
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$?
Easy
View SolutionUsing mathematical induction,prove that $\frac{d}{dx}(x^n) = nx^{n-1}$ for all positive integers $n$.
Difficult
View SolutionProve the statement by the Principle of Mathematical Induction :
$1+5+9+\ldots+(4 n-3)=n(2 n-1)$ for all natural numbers $n$.
$1+5+9+\ldots+(4 n-3)=n(2 n-1)$ for all natural numbers $n$.
Medium
View SolutionUse the Principle of Mathematical Induction to show that for a sequence $a_{1}, a_{2}, a_{3}, \ldots$ defined by $a_{1}=3$ and $a_{k}=7 a_{k-1}$ for all natural numbers $k > 1$,the general term is $a_{n}=3 \cdot 7^{n-1}$ for all $n \in N$.
Difficult
View SolutionProve the following by using the principle of mathematical induction for all $n \in N$:
$\left(1+\frac{1}{1}\right)\left(1+\frac{1}{2}\right)\left(1+\frac{1}{3}\right) \dots\left(1+\frac{1}{n}\right)=(n+1)$
$\left(1+\frac{1}{1}\right)\left(1+\frac{1}{2}\right)\left(1+\frac{1}{3}\right) \dots\left(1+\frac{1}{n}\right)=(n+1)$
Medium
View SolutionVedclass Products
For Students
Vedclass Test Series
Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.
Start Free TrialFor Teachers
Exam Paper Generator
Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.
Try FreeFor Institutes
Online Exam Module
Live online exams with unlimited students, 360° analytics & white-label branding.
See Demo