Advertisements
Advertisements
Question
Advertisements
Solution
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
RELATED QUESTIONS
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/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 (2n +7) < (n + 3)2
If P (n) is the statement "n(n + 1) is even", then what is P(3)?
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}\] .
\[\frac{1}{1 . 4} + \frac{1}{4 . 7} + \frac{1}{7 . 10} + . . . + \frac{1}{(3n - 2)(3n + 1)} = \frac{n}{3n + 1}\]
\[\frac{1}{3 . 5} + \frac{1}{5 . 7} + \frac{1}{7 . 9} + . . . + \frac{1}{(2n + 1)(2n + 3)} = \frac{n}{3(2n + 3)}\]
1.2 + 2.22 + 3.23 + ... + n.2n = (n − 1) 2n+1+2
12 + 32 + 52 + ... + (2n − 1)2 = \[\frac{1}{3}n(4 n^2 - 1)\]
\[\text { A sequence } x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_1 = 2 \text{ and } x_k = \frac{x_{k - 1}}{k} \text{ for all natural numbers } k, k \geq 2 . \text{ Show that } x_n = \frac{2}{n!} \text{ for all } n \in N .\]
Prove by method of induction, for all n ∈ N:
(24n−1) is divisible by 15
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
2 + 3.2 + 4.22 + ... + (n + 1)2n–1 = n.2n
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:
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 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:
n3 – n is divisible by 6, for each natural number n ≥ 2.
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.
Prove the statement by using the Principle of Mathematical Induction:
2 + 4 + 6 + ... + 2n = n2 + n for all natural numbers n.
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 b0, b1, b2 ... is defined by letting b0 = 5 and bk = 4 + bk – 1 for all natural numbers k. Show that bn = 5 + 4n for all natural number n using mathematical induction.
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 for all n ∈ N.
cos α + cos(α + β) + cos(α + 2β) + ... + cos(α + (n – 1)β) = `(cos(alpha + ((n - 1)/2)beta)sin((nbeta)/2))/(sin beta/2)`.
Prove that, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin ((n + 1))/2 theta)/(sin theta/2)`, for all n ∈ N.
If xn – 1 is divisible by x – k, then the least positive integral value of k is ______.
If P(n): 2n < n!, n ∈ N, then P(n) is true for all n ≥ ______.
By using principle of mathematical induction for every natural number, (ab)n = ______.
