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.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:
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:
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 "n(n + 1) is even", then what is P(3)?
If P (n) is the statement "n3 + n is divisible by 3", prove that P (3) is true but P (4) is not true.
If P (n) is the statement "2n ≥ 3n" and if P (r) is true, prove that P (r + 1) is true.
\[\frac{1}{1 . 4} + \frac{1}{4 . 7} + \frac{1}{7 . 10} + . . . + \frac{1}{(3n - 2)(3n + 1)} = \frac{n}{3n + 1}\]
1.2 + 2.22 + 3.23 + ... + n.2n = (n − 1) 2n+1+2
1.2 + 2.3 + 3.4 + ... + n (n + 1) = \[\frac{n(n + 1)(n + 2)}{3}\]
52n+2 −24n −25 is divisible by 576 for all n ∈ N.
n(n + 1) (n + 5) is a multiple of 3 for all n ∈ N.
7 + 77 + 777 + ... + 777 \[{. . . . . . . . . . .}_{n - \text{ digits } } 7 = \frac{7}{81}( {10}^{n + 1} - 9n - 10)\]
Let P(n) be the statement : 2n ≥ 3n. If P(r) is true, show that P(r + 1) is true. Do you conclude that P(n) is true for all n ∈ N?
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:
`1/(1.3) + 1/(3.5) + 1/(5.7) + ... + 1/((2"n" - 1)(2"n" + 1)) = "n"/(2"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:
3n − 2n − 1 is divisible by 4
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, for all n ∈ N
8 + 17 + 26 + … + (9n – 1) = `"n"/2(9"n" + 7)`
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:
`(1 - 1/2^2).(1 - 1/3^2)...(1 - 1/n^2) = (n + 1)/(2n)`, for all natural numbers, n ≥ 2.
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
2n + 1 < 2n, for all natual numbers n ≥ 3.
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 ______.
Give an example of a statement P(n) which is true for all n. Justify your answer.
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:
32n – 1 is divisible by 8, for all natural numbers n.
Prove the statement by using the Principle of Mathematical Induction:
n2 < 2n for all natural numbers n ≥ 5.
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.
Show that `n^5/5 + n^3/3 + (7n)/15` is a natural number for all n ∈ N.
Prove that `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.
