Advertisements
Advertisements
प्रश्न
Prove by method of induction, for all n ∈ N:
`1/(3.5) + 1/(5.7) + 1/(7.9) + ...` to n terms = `"n"/(3(2"n" + 3))`
Advertisements
उत्तर
Let P(n) ≡ `1/(3.5) + 1/(5.7) + 1/(7.9) + ...` to n terms = `"n"/(3(2"n" + 3))`, for all n ∈ N
But the first factor in each term of the denominator
i.e., 3, 5, 7, … are in A.P. with a = 3 and d = 2.
∴ nth term = a + (n – 1)d = 3 + (n – 1)2 = (2n + 1)
Also, second factor in each term of denominator
i.e., 5, 7, 9, … are in A.P. with a = 5 and d = 2.
∴ nth term = a + (n – 1)d = 5 + (n – 1)2 = (2n + 3)
∴ nth term tn = `1/((2"n" + 1)(2"n" + 3))`
∴ P(n) ≡ `1/(3.5) + 1/(5.7) + 1/(7.9) + ... + 1/((2"n" + 1)(2"n" + 3)) = "n"/(3(2"n" + 3))`
Step I:
Put n = 1
L.H.S. = `1/(3.5) = 1/15`
R.H.S. = `1/(3[2(1) + 3]) = 1/(3(2 + 3)) = 1/15` = L.H.S.
∴ P(n) is true for n = 1
Step II:
Let us consider that P(n) is true for n = k
∴ `1/(3.5) + 1/(5.7) + 1/(7.9) + ... + 1/((2"k" + 1).(2"k" + 3)) = "k"/(3(2"k" + 3))` ...(i)
Step III:
We have to prove that P(n) is true for n = k + 1
i.e., to prove that
`1/(3.5) + 1/(5.7) + 1/(7.9) + ... + 1/((2"k" + 3).(2"k" + 5)) = ("k" + 1)/(3(2"k" + 5))`
L.H.S. = `1/(3.5) + 1/(5.7) + 1/(7.9) + ... + 1/((2"k" + 3)(2"k" + 5))`
= `1/(3.5) + 1/(5.7) + 1/(7.9) + ... + 1/((2"k" + 1)(2"k" + 3)) + 1/((2"k" + 3)(2"k" + 5))`
= `"k"/(3(2"k" + 3)) + 1/((2"k" + 3)(2"k" + 5))` ...[From (i)]
= `("k"(2"k" + 5) + 3)/(3(2"k" + 3)(2"k" + 5))`
= `(2"k"^2 + 5"k" + 3)/(3(2"k" + 3)(2"k" + 5))`
= `(2"k"^2 + 2"k" + 3"k" + 3)/(3(2"k" + 3)(2"k" + 5)`
= `(2"k"("k" + 1) + 3("k" + 1))/(3(2"k" + 3)(2"k" + 5))`
= `((2"k" + 3)("k" + 1))/(3("2k" + 3)(2"k" + 5))`
= `("k" + 1)/(3(2"k" + 5))`
= R.H.S.
∴ P(n) is true for n = k + 1
Step IV:
From all steps above by the principle of mathematical induction, P(n) is true for all n ∈ N.
∴ `1/(3.5) + 1/(5.7) + 1/(7.9) + ...` to n terms = `"n"/(3(2"n" + 3))` for all n ∈ 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:
1.2 + 2.3 + 3.4+ ... + n(n+1) = `[(n(n+1)(n+2))/3]`
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: x2n – y2n is divisible by x + y.
Prove the following by using the principle of mathematical induction for all n ∈ N: 32n + 2 – 8n– 9 is divisible by 8.
12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .
2 + 5 + 8 + 11 + ... + (3n − 1) = \[\frac{1}{2}n(3n + 1)\]
1.3 + 2.4 + 3.5 + ... + n. (n + 2) = \[\frac{1}{6}n(n + 1)(2n + 7)\]
12 + 32 + 52 + ... + (2n − 1)2 = \[\frac{1}{3}n(4 n^2 - 1)\]
a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]
52n+2 −24n −25 is divisible by 576 for all n ∈ N.
32n+2 −8n − 9 is divisible by 8 for all n ∈ N.
(ab)n = anbn for all n ∈ N.
2.7n + 3.5n − 5 is divisible by 24 for all n ∈ N.
Prove that n3 - 7n + 3 is divisible by 3 for all n \[\in\] N .
x2n−1 + y2n−1 is divisible by x + y for all n ∈ N.
\[\text{ Given } a_1 = \frac{1}{2}\left( a_0 + \frac{A}{a_0} \right), a_2 = \frac{1}{2}\left( a_1 + \frac{A}{a_1} \right) \text{ and } a_{n + 1} = \frac{1}{2}\left( a_n + \frac{A}{a_n} \right) \text{ for } n \geq 2, \text{ where } a > 0, A > 0 . \]
\[\text{ Prove that } \frac{a_n - \sqrt{A}}{a_n + \sqrt{A}} = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right) 2^{n - 1} .\]
Prove that the number of subsets of a set containing n distinct elements is 2n, for all n \[\in\] N .
Prove by method of induction, for all n ∈ N:
1.3 + 3.5 + 5.7 + ..... to n terms = `"n"/3(4"n"^2 + 6"n" - 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:
5 + 52 + 53 + .... + 5n = `5/4(5^"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:
Given that tn+1 = 5tn − 8, t1 = 3, prove by method of induction that tn = 5n−1 + 2
Answer the following:
Prove by method of induction 152n–1 + 1 is divisible by 16, for all n ∈ N.
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))`
Prove the statement by using the Principle of Mathematical Induction:
For any natural number n, 7n – 2n is divisible by 5.
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:
n(n2 + 5) is divisible by 6, for each natural number n.
Prove the statement by using the Principle of Mathematical Induction:
2 + 4 + 6 + ... + 2n = n2 + n 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.
Prove that, cosθ cos2θ cos22θ ... cos2n–1θ = `(sin 2^n theta)/(2^n sin theta)`, for all n ∈ N.
If P(n): 2n < n!, n ∈ N, then P(n) is true for all n ≥ ______.
State whether the following statement is true or false. Justify.
Let P(n) be a statement and let P(k) ⇒ P(k + 1), for some natural number k, then P(n) is true for all n ∈ N.
