Advertisements
Advertisements
Question
a + ar + ar2 + ... + arn−1 = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]
Advertisements
Solution
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
RELATED QUESTIONS
Prove the following by using the principle of mathematical induction for all n ∈ N:
`1^3 + 2^3 + 3^3 + ... + n^3 = ((n(n+1))/2)^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+3/1)(1+ 5/4)(1+7/9)...`(1 + ((2n + 1))/n^2) = (n + 1)^2`
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.
Given an example of a statement P (n) such that it is true for all n ∈ N.
1 + 2 + 3 + ... + n = \[\frac{n(n + 1)}{2}\] i.e. the sum of the first n natural numbers is \[\frac{n(n + 1)}{2}\] .
12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .
\[\frac{1}{1 . 2} + \frac{1}{2 . 3} + \frac{1}{3 . 4} + . . . + \frac{1}{n(n + 1)} = \frac{n}{n + 1}\]
\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 5} + . . . + \frac{1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\]
\[\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]
a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]
52n −1 is divisible by 24 for all n ∈ N.
32n+7 is divisible by 8 for all n ∈ N.
32n+2 −8n − 9 is divisible by 8 for all n ∈ N.
72n + 23n−3. 3n−1 is divisible by 25 for all n ∈ N.
Prove by method of induction, for all n ∈ N:
13 + 33 + 53 + .... to n terms = n2(2n2 − 1)
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
12 + 42 + 72 + ... + (3n − 2)2 = `"n"/2 (6"n"^2 - 3"n" - 1)`
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 52n − 22n is divisible by 3, for all n ∈ N
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"):}`
Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.
A student was asked to prove a statement P(n) by induction. He proved that P(k + 1) is true whenever P(k) is true for all k > 5 ∈ N and also that P(5) is true. On the basis of this he could conclude that P(n) is true ______.
Prove the statement by using the Principle of Mathematical Induction:
4n – 1 is divisible by 3, for each natural number n.
Prove the statement by using the Principle of Mathematical Induction:
n3 – 7n + 3 is divisible by 3, 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:
`sqrt(n) < 1/sqrt(1) + 1/sqrt(2) + ... + 1/sqrt(n)`, for all natural numbers n ≥ 2.
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 for all n ∈ N.
cos α + cos(α + β) + cos(α + 2β) + ... + cos(α + (n – 1)β) = `(cos(alpha + ((n - 1)/2)beta)sin((nbeta)/2))/(sin beta/2)`.
Prove that, cosθ cos2θ cos22θ ... cos2n–1θ = `(sin 2^n theta)/(2^n sin theta)`, for all n ∈ N.
Show that `n^5/5 + n^3/3 + (7n)/15` is a natural number for all n ∈ N.
By using principle of mathematical induction for every natural number, (ab)n = ______.
