Advertisements
Advertisements
Question
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
Solution
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
RELATED QUESTIONS
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: 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 "n2 + n is even", and if P (r) is true, then P (r + 1) is true.
1 + 3 + 5 + ... + (2n − 1) = n2 i.e., the sum of first n odd natural numbers is n2.
1.3 + 2.4 + 3.5 + ... + n. (n + 2) = \[\frac{1}{6}n(n + 1)(2n + 7)\]
n(n + 1) (n + 5) is a multiple of 3 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} .\]
Show by the Principle of Mathematical induction that the sum Sn of then terms of the series \[1^2 + 2 \times 2^2 + 3^2 + 2 \times 4^2 + 5^2 + 2 \times 6^2 + 7^2 + . . .\] is given by \[S_n = \binom{\frac{n \left( n + 1 \right)^2}{2}, \text{ if n is even} }{\frac{n^2 \left( n + 1 \right)}{2}, \text{ if n is odd } }\]
Prove that the number of subsets of a set containing n distinct elements is 2n, for all n \[\in\] N .
\[\text{ A sequence } a_1 , a_2 , a_3 , . . . \text{ is defined by letting } a_1 = 3 \text{ and } a_k = 7 a_{k - 1} \text{ for all natural numbers } k \geq 2 . \text{ Show that } a_n = 3 \cdot 7^{n - 1} \text{ for all } n \in 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:
12 + 32 + 52 + .... + (2n − 1)2 = `"n"/3 (2"n" − 1)(2"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:
(cos θ + i sin θ)n = cos (nθ) + i sin (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, 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 52n − 22n is divisible by 3, for all n ∈ N
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
`sum_(t = 1)^(n - 1) t(t + 1) = (n(n - 1)(n + 1))/3`, for all natural numbers n ≥ 2.
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
22n – 1 is divisible by 3.
The distributive law from algebra says that for all real numbers c, a1 and a2, we have c(a1 + a2) = ca1 + ca2.
Use this law and mathematical induction to prove that, for all natural numbers, n ≥ 2, if c, a1, a2, ..., an are any real numbers, then c(a1 + a2 + ... + an) = ca1 + ca2 + ... + can.
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 ______.
State whether the following proof (by mathematical induction) is true or false for the statement.
P(n): 12 + 22 + ... + n2 = `(n(n + 1) (2n + 1))/6`
Proof By the Principle of Mathematical induction, P(n) is true for n = 1,
12 = 1 = `(1(1 + 1)(2*1 + 1))/6`. Again for some k ≥ 1, k2 = `(k(k + 1)(2k + 1))/6`. Now we prove that
(k + 1)2 = `((k + 1)((k + 1) + 1)(2(k + 1) + 1))/6`
Prove the statement by using the Principle of Mathematical Induction:
23n – 1 is divisible by 7, for all natural numbers 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:
n3 – n is divisible by 6, for each natural number n ≥ 2.
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.
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 + 2 + 22 + ... + 2n = 2n+1 – 1 for all natural numbers n.
Prove that `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.
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.
