Advertisements
Advertisements
प्रश्न
\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 5} + . . . + \frac{1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\]
Advertisements
उत्तर
Let P(n) be the given statement.
Now,
\[P(n) = \frac{1}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 15} + . . . + \frac{{}^1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\]
\[\text{ Step} 1: \]
\[P(1) = \frac{1}{3 . 7} = \frac{1}{21} = \frac{1}{3(4 + 3)}\]
\[\text{ Hence, P(1) is true } . \]
\[\text{ Step } 2: \]
\[\text{ Let P(m) is true} . \]
\[\text{ Then} , \]
\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + . . . + \frac{1}{(4m - 1)(4m + 3)} = \frac{m}{3(4m + 3)}\]
\[\text{ To prove: P(m + 1) is true .} \]
\[\text{ That is} , \]
\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + . . . + \frac{1}{(4m + 3)(4m + 7)} = \frac{m + 1}{3(4m + 7)}\]
\[Now, \]
\[P(m) = \frac{1}{3 . 7} + \frac{1}{7 . 11} + . . . + \frac{1}{(4m - 1)(4m + 3)} = \frac{m}{3(4m + 3)}\]
\[ \Rightarrow \frac{1}{3 . 7} + \frac{1}{7 . 11} + . . . + \frac{1}{(4m - 1)(4m + 3)} + \frac{1}{(4m + 3)(4m + 7)} = \frac{m}{3(4m + 3)} + \frac{1}{(4m + 3)(4m + 7)} \left[ \text{ Adding } \frac{1}{(4m + 3)(4m + 7)} \text{ to both sides } \right]\]
\[ \Rightarrow \frac{1}{3 . 7} + \frac{1}{7 . 11} + . . . + \frac{1}{(4m + 3)(4m + 7)} = \frac{4 m^2 + 7m + 3}{3(4m + 3)(4m + 7)} = \frac{(4m + 3)(m + 1)}{3(4m + 3)(4m + 7)} = \frac{m + 1}{3(4m + 7)}\]
\[\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+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+ 1/1)(1+ 1/2)(1+ 1/3)...(1+ 1/n) = (n + 1)`
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.
If P (n) is the statement "n3 + n is divisible by 3", prove that P (3) is true but P (4) is not true.
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}\] .
1.2 + 2.22 + 3.23 + ... + n.2n = (n − 1) 2n+1+2
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.
11n+2 + 122n+1 is divisible by 133 for all n ∈ N.
Prove that n3 - 7n + 3 is divisible by 3 for all n \[\in\] N .
\[\text{ Let } P\left( n \right) \text{ be the statement } : 2^n \geq 3n . \text{ If } P\left( r \right) \text{ is true, then show that } P\left( r + 1 \right) \text{ is true . Do you conclude that } P\left( n \right)\text{ is true for all n } \in 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:
12 + 22 + 32 + .... + n2 = `("n"("n" + 1)(2"n" + 1))/6`
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))`
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
`[(3, -4),(1, -1)]^"n" = [(2"n" + 1, -4"n"),("n", -2"n" + 1)], ∀ "n" ∈ "N"`
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
2n + 1 < 2n, for all natual numbers n ≥ 3.
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 the Principle of Mathematical Induction that 1 × 1! + 2 × 2! + 3 × 3! + ... + n × n! = (n + 1)! – 1 for all natural numbers 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
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:
For any natural number n, 7n – 2n is divisible by 5.
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:
1 + 2 + 22 + ... + 2n = 2n+1 – 1 for all natural numbers n.
For all n ∈ N, 3.52n+1 + 23n+1 is divisible by ______.
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.
By using principle of mathematical induction for every natural number, (ab)n = ______.
