Advertisements
Advertisements
प्रश्न
12 + 32 + 52 + ... + (2n − 1)2 = \[\frac{1}{3}n(4 n^2 - 1)\]
Advertisements
उत्तर
Let P(n) be the given statement.
Now,
\[P(n) = 1^2 + 3^2 + 5^2 + . . . + (2n - 1 )^2 = \frac{1}{3}n(4 n^2 - 1)\]
\[\text{ Step 1:} \]
\[P(1) = 1^2 = 1 = \frac{1}{3} \times 1 \times (4 - 1)\]
\[\text{ Hence, P(1) is true } . \]
\[\text{ Step 2: } \]
\[\text{ Let P(m) be true } . \]
\[\text{ Then, } \]
\[ 1^2 + 3^2 + . . . + (2m - 1 )^2 = \frac{1}{3}m(4 m^2 - 1)\]
\[\text{ To prove: P(m + 1) is true whenever P(m) is true } . \]
\[\text{ That is, } \]
\[ 1^2 + 3^2 = . . . + (2m + 1 )^2 = \frac{1}{3}(m + 1)\left\{ 4(m + 1 )^2 - 1 \right\}\]
\[\text{ We know that P(m) is true } . \]
\[\text{ Thus, we have: } \]
\[ 1^2 + 3^2 + . . . + (2m - 1 )^2 = \frac{1}{3}m(4 m^2 - 1)\]
\[ \Rightarrow 1^2 + 3^2 + . . . + (2m - 1 )^2 + (2m + 1 )^2 = \frac{1}{3}m(4 m^2 - 1) + (2m + 1 )^2 \left[ \text{ Adding } (2m + 1 )^2 \text{ to both sides } \right]\]
\[ \Rightarrow P(m + 1) = \frac{1}{3}\left( 4 m^3 - m + 12 m^2 + 12m + 3 \right)\]
\[ \Rightarrow P(m + 1) = \frac{1}{3}(4 m^3 - m + 8 m^2 + 4m + 4 m^2 + 8m + 3)\]
\[ = \frac{1}{3}(m + 1)(4 m^2 + 8m + 3) \]
\[ = \frac{1}{3}(m + 1)(4(m + 1 )^2 - 1)\]
\[\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 + 2^3 + 3^3 + ... + n^3 = ((n(n+1))/2)^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:
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 "n2 + n is even", and if P (r) is true, then P (r + 1) is true.
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.
1 + 3 + 32 + ... + 3n−1 = \[\frac{3^n - 1}{2}\]
\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]
a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]
52n+2 −24n −25 is divisible by 576 for all n ∈ N.
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)\] for n ≥ 2, where a > 0, A > 0.
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}\]
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?
\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\] for all n ∈ N .
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:
(24n−1) is divisible by 15
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
`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
`[(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:
`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:
2n + 1 < 2n, for all natual numbers n ≥ 3.
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))`
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, xn – yn is divisible by x – y, where x and y are any integers with x ≠ y.
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.
For all n ∈ N, 3.52n+1 + 23n+1 is divisible by ______.
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 ≥ ______.
