Advertisements
Advertisements
प्रश्न
a + ar + ar2 + ... + arn−1 = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]
उत्तर
Let P(n) be the given statement.
Now,
\[P(n) = a + ar + a r^2 + . . . + a r^{n - 1} = a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]
\[\text{ Step } 1: \]
\[P(1) = a = a\left( \frac{r^1 - 1}{r - 1} \right)\]
\[\text{ Hence, P(1) is true } . \]
\[\text{ Step 2} : \]
\[\text{ Suppose P(m) is true } . \]
\[\text{ Then } , \]
\[a + ar + a r^2 + . . . + a r^{m - 1} = a\left( \frac{r^m - 1}{r - 1} \right), r \neq 1\]
\[\text{ To show: P(m + 1) is true whenever P(m) is true } . \]
\[\text{ That is, } \]
\[a + ar + a r^2 + . . . + a r^m = a\left( \frac{r^{m + 1} - 1}{r - 1} \right), r \neq 1\]
\[\text{ We know that P(m) is true} . \]
\[\text{ Thus, we have: } \]
\[a + ar + a r^2 + . . . + a r^{m - 1} = a\left( \frac{r^m - 1}{r - 1} \right)\]
\[ \Rightarrow a + ar + a r^2 + . . . + a r^{m - 1} + a r^m = a\left( \frac{r^m - 1}{r - 1} \right) + a r^m \left[ \text{ Adding } a r^m \text{ to both sides} \right]\]
\[ \Rightarrow P(m + 1) = a\left( \frac{r^m - 1 + r . r^m - r^m}{r - 1} \right)\]
\[ \Rightarrow P(m + 1) = a\left( \frac{r^{m + 1} - 1}{r - 1} \right), r \neq 1\]
\[\text{ Thus, P(m + 1) is true . } \]
\[\text{ By the principle of mathematical induction, P(n) is true for all n } \in N .\]
APPEARS IN
संबंधित प्रश्न
Prove the following by using the principle of mathematical induction for all n ∈ N:
`1 + 3 + 3^2 + ... + 3^(n – 1) =((3^n -1))/2`
Prove the following by using the principle of mathematical induction for all n ∈ N:
Prove the following by using the principle of mathematical induction for all n ∈ N: 1.2 + 2.22 + 3.22 + … + n.2n = (n – 1) 2n+1 + 2
Prove the following by using the principle of mathematical induction for all n ∈ N:
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: n (n + 1) (n + 5) is a multiple of 3.
Prove the following by using the principle of mathematical induction for all n ∈ N: 102n – 1 + 1 is divisible by 11
If P (n) is the statement "n(n + 1) is even", then what is P(3)?
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.
12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .
1 + 3 + 5 + ... + (2n − 1) = n2 i.e., the sum of first n odd natural numbers is n2.
\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]
\[\frac{1}{3 . 5} + \frac{1}{5 . 7} + \frac{1}{7 . 9} + . . . + \frac{1}{(2n + 1)(2n + 3)} = \frac{n}{3(2n + 3)}\]
1.2 + 2.22 + 3.23 + ... + n.2n = (n − 1) 2n+1+2
2 + 5 + 8 + 11 + ... + (3n − 1) = \[\frac{1}{2}n(3n + 1)\]
1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]
52n −1 is divisible by 24 for all n ∈ N.
32n+7 is divisible by 8 for all n ∈ N.
Prove that n3 - 7n + 3 is divisible by 3 for all n \[\in\] 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:
12 + 22 + 32 + .... + n2 = `("n"("n" + 1)(2"n" + 1))/6`
Prove by method of induction, for all n ∈ N:
(23n − 1) is divisible by 7
Prove by method of induction, for all n ∈ N:
(24n−1) is divisible by 15
Prove by method of induction, for all n ∈ N:
(cos θ + i sin θ)n = cos (nθ) + i sin (nθ)
Prove by method of induction, for all n ∈ N:
`[(1, 2),(0, 1)]^"n" = [(1, 2"n"),(0, 1)]` ∀ n ∈ N
Answer the following:
Prove by method of induction 152n–1 + 1 is divisible by 16, for all n ∈ N.
Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.
Prove the statement by using the Principle of Mathematical Induction:
32n – 1 is divisible by 8, for all natural numbers n.
Prove the statement by using the Principle of Mathematical Induction:
For any natural number n, xn – yn is divisible by x – y, where x and y are any integers with x ≠ y.
Prove the statement by using the Principle of Mathematical Induction:
1 + 5 + 9 + ... + (4n – 3) = n(2n – 1) for all natural numbers n.
