Advertisements
Advertisements
प्रश्न
\[\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]
Advertisements
उत्तर
Let P(n) be the given statement.
Now,
\[P(n): \frac{1}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]
\[\text{ Step } 1: \]
\[ P(1) = \frac{1}{2} = 1 - \frac{1}{2^1}\]
\[\text{ Thus, P(1) is true .} \]
\[\text{ Step 2: } \]
\[\text{ Suppose P(m) is true .} \]
\[\text{ Then,} \]
\[\frac{1}{2} + \frac{1}{4} + . . . + \frac{1}{2^m} = 1 - \frac{1}{2^m}\]
\[\text{ To show: P(m + 1) is true whenever P(m) is true } . \]
\[\text{ That is, } \]
\[\frac{1}{2} + \frac{1}{4} + . . . + \frac{1}{2^{{}^{m + 1}}} = 1 - \frac{1}{2^{m + 1}}\]
\[\text{ Now, P(m) is true } . \]
\[\text{ Thus, we have: } \]
\[\frac{1}{2} + \frac{1}{4} + . . . + \frac{1}{2^m} = 1 - \frac{1}{2^m}\]
\[ \Rightarrow \frac{1}{2} + \frac{1}{4} + . . . + \frac{1}{2^m} + \frac{1}{2^{m + 1}} = 1 - \frac{1}{2^m} + \frac{1}{2^{m + 1}} \left[ \text{ Adding } \frac{1}{2^{m + 1}} \text{ to both sides } \right]\]
\[ \Rightarrow P(m + 1) = 1 - \frac{1}{2^m} + \frac{1}{2^m . 2} = 1 - \frac{1}{2^{{}^m}}\left( 1 - \frac{1}{2} \right) = 1 - \frac{1}{2^{m + 1}}\]
Thus , P ( m + 1) is true
$By the principle of mathematical induction, P(n) is true for all n ∈ N .
APPEARS IN
संबंधित प्रश्न
Prove the following by using the principle of mathematical induction for all n ∈ N: 1.2.3 + 2.3.4 + … + n(n + 1) (n + 2) = `(n(n+1)(n+2)(n+3))/(4(n+3))`
Prove the following by using the principle of mathematical induction for all n ∈ N: `1+2+ 3+...+n<1/8(2n +1)^2`
Prove the following by using the principle of mathematical induction for all n ∈ N: 32n + 2 – 8n– 9 is divisible by 8.
If P (n) is the statement "n3 + n is divisible by 3", prove that P (3) is true but P (4) is not true.
Given an example of a statement P (n) such that it is true for all n ∈ N.
Give an example of a statement P(n) which is true for all n ≥ 4 but P(1), P(2) and P(3) are not true. Justify your answer.
1 + 3 + 5 + ... + (2n − 1) = n2 i.e., the sum of first n odd natural numbers is n2.
\[\frac{1}{1 . 4} + \frac{1}{4 . 7} + \frac{1}{7 . 10} + . . . + \frac{1}{(3n - 2)(3n + 1)} = \frac{n}{3n + 1}\]
\[\frac{1}{3 . 5} + \frac{1}{5 . 7} + \frac{1}{7 . 9} + . . . + \frac{1}{(2n + 1)(2n + 3)} = \frac{n}{3(2n + 3)}\]
\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 5} + . . . + \frac{1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\]
a + ar + ar2 + ... + arn−1 = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]
a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]
32n+2 −8n − 9 is divisible by 8 for all n ∈ N.
n(n + 1) (n + 5) is a multiple of 3 for all n ∈ N.
72n + 23n−3. 3n−1 is divisible by 25 for all n ∈ N.
11n+2 + 122n+1 is divisible by 133 for all n ∈ N.
\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\] for all n ∈ N .
x2n−1 + y2n−1 is divisible by x + y for all n ∈ N.
\[\text{ The distributive law from algebra states that for all real numbers} c, a_1 \text{ and } a_2 , \text{ we have } c\left( a_1 + a_2 \right) = c a_1 + c a_2 . \]
\[\text{ Use this law and mathematical induction to prove that, for all natural numbers, } n \geq 2, if c, a_1 , a_2 , . . . , a_n \text{ are any real numbers, then } \]
\[c\left( a_1 + a_2 + . . . + a_n \right) = c a_1 + c a_2 + . . . + c a_n\]
Prove by method of induction, for all n ∈ N:
(23n − 1) is divisible by 7
Prove by method of induction, for all n ∈ N:
3n − 2n − 1 is divisible by 4
Prove by method of induction, for all n ∈ N:
(cos θ + i sin θ)n = cos (nθ) + i sin (nθ)
Answer the following:
Prove, by method of induction, for all n ∈ N
2 + 3.2 + 4.22 + ... + (n + 1)2n–1 = n.2n
Answer the following:
Prove, by method of induction, for all n ∈ N
`1/(3.4.5) + 2/(4.5.6) + 3/(5.6.7) + ... + "n"/(("n" + 2)("n" + 3)("n" + 4)) = ("n"("n" + 1))/(6("n" + 3)("n" + 4))`
Answer the following:
Prove by method of induction
`[(3, -4),(1, -1)]^"n" = [(2"n" + 1, -4"n"),("n", -2"n" + 1)], ∀ "n" ∈ "N"`
Answer the following:
Prove by method of induction 152n–1 + 1 is divisible by 16, for all n ∈ N.
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
22n – 1 is divisible by 3.
Define the sequence a1, a2, a3 ... as follows:
a1 = 2, an = 5 an–1, for all natural numbers n ≥ 2.
Use the Principle of Mathematical Induction to show that the terms of the sequence satisfy the formula an = 2.5n–1 for all natural numbers.
Prove by induction that for all natural number n sinα + sin(α + β) + sin(α + 2β)+ ... + sin(α + (n – 1)β) = `(sin (alpha + (n - 1)/2 beta)sin((nbeta)/2))/(sin(beta/2))`
Show by the Principle of Mathematical Induction that the sum Sn of the n term of the series 12 + 2 × 22 + 32 + 2 × 42 + 52 + 2 × 62 ... is given by
Sn = `{{:((n(n + 1)^2)/2",", "if n is even"),((n^2(n + 1))/2",", "if n is odd"):}`
Give an example of a statement P(n) which is true for all n ≥ 4 but P(1), P(2) and P(3) are not true. Justify your answer
Prove the statement by using the Principle of Mathematical Induction:
1 + 2 + 22 + ... + 2n = 2n+1 – 1 for all natural numbers n.
Prove the statement by using the Principle of Mathematical Induction:
1 + 5 + 9 + ... + (4n – 3) = n(2n – 1) for all natural numbers n.
A sequence a1, a2, a3 ... is defined by letting a1 = 3 and ak = 7ak – 1 for all natural numbers k ≥ 2. Show that an = 3.7n–1 for all natural numbers.
A sequence d1, d2, d3 ... is defined by letting d1 = 2 and dk = `(d_(k - 1))/"k"` for all natural numbers, k ≥ 2. Show that dn = `2/(n!)` for all n ∈ N.
Prove that, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin ((n + 1))/2 theta)/(sin theta/2)`, for all n ∈ N.
Consider the statement: “P(n) : n2 – n + 41 is prime." Then which one of the following is true?
By using principle of mathematical induction for every natural number, (ab)n = ______.
