Advertisements
Advertisements
प्रश्न
Advertisements
उत्तर
Let P(n) be the given statement.
Thus, we have:
\[P\left( n \right): 1 + \frac{1}{4} + \frac{1}{9} + . . . + \frac{1}{n^2} < 2 - \frac{1}{n}\]
\[\text{ Step} 1: P(2): \frac{1}{2^2} = \frac{1}{4} < 2 - \frac{1}{2}\]
\[\text{ Thus, } P\left( 2 \right) \text{ is true } . \left[ \text{ We have not taken n = 1 because it is not possible . We will start this function from n = 2 onwards . } \right]\]
\[\text{ Step} 2: \]
\[\text{ Let P } \left( m \right) \text{ be true .} \]
\[\text{ Now } , \]
\[1 + \frac{1}{4} + \frac{1}{9} + . . . + \frac{1}{m^2} < 2 - \frac{1}{m}\]
\[\text{ We need to prove that P(m + 1) is true } . \]
\[\text{ We know that P(m) is true } . \]
\[\text{ Thus, we have: } \]
\[1 + \frac{1}{4} + \frac{1}{9} + . . . + \frac{1}{m^2} < 2 - \frac{1}{m}\]
\[ \Rightarrow 1 + \frac{1}{4} + \frac{1}{9} + . . . + \frac{1}{m^2} + \frac{1}{\left( m + 1 \right)^2} < 2 - \frac{1}{m} + \frac{1}{\left( m + 1 \right)^2} \left[ \text{ Adding } \frac{1}{(m + 1 )^2} to \text{ both sides } \right]\]
\[ \Rightarrow P\left( m + 1 \right) < 2 - \frac{1}{m + 1} \left[ \because \left( m + 1 \right)^2 > m + 1, \frac{1}{\left( m + 1 \right)^2} < \frac{1}{m + 1} \Rightarrow \frac{1}{m} - \frac{1}{\left( m + 1 \right)^2} < \frac{1}{m + 1} as m < m + 1 \right] \]
\[\text{ Thus, } P\left( m + 1 \right) \text{ is true } . \]
\[\text{ By principle of mathematical induction, P(n) is true for all n } \in N, n \geq 2 .\]
APPEARS IN
संबंधित प्रश्न
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 + 1/4 + 1/8 + ... + 1/2^n = 1 - 1/2^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:
(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.4 + 1/4.7 + 1/7.10 + ... + 1/((3n - 2)(3n + 1)) = n/((3n + 1))`
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 (2n +7) < (n + 3)2
Given an example of a statement P (n) such that it is true for all n ∈ N.
1 + 3 + 5 + ... + (2n − 1) = n2 i.e., the sum of first n odd natural numbers is n2.
\[\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]
32n+7 is divisible by 8 for all n ∈ N.
52n+2 −24n −25 is divisible by 576 for all n ∈ N.
(ab)n = anbn for all n ∈ N.
11n+2 + 122n+1 is divisible by 133 for all n ∈ N.
\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\] for all n ∈ N .
\[\text{ A sequence } x_0 , x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_0 = 5 and x_k = 4 + x_{k - 1}\text{ for all natural number k . } \]
\[\text{ Show that } x_n = 5 + 4n \text{ for all n } \in N \text{ using mathematical induction .} \]
Prove by method of induction, for all n ∈ N:
2 + 4 + 6 + ..... + 2n = n (n+1)
Prove by method of induction, for all n ∈ N:
3 + 7 + 11 + ..... + to n terms = n(2n+1)
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.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:
5 + 52 + 53 + .... + 5n = `5/4(5^"n" - 1)`
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.
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:
23n – 1 is divisible by 7, for all natural numbers 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:
2n < (n + 2)! for all natural number n.
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, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin ((n + 1))/2 theta)/(sin theta/2)`, for all n ∈ N.
