Advertisements
Advertisements
प्रश्न
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 } }\]
Advertisements
उत्तर
\[ \text{ Let } P\left( n \right): S_n = 1^2 + 2 \times 2^2 + 3^2 + 2 \times 4^2 + 5^2 + . . . = \binom{\frac{n \left( n + 1 \right)^2}{2}, \text{ when n is even } }{\frac{n^2 \left( n + 1 \right)}{2}, \text{ when n is odd} }\]
\[\text{ Step I: For } n = 1 i . e . P\left( 1 \right): \]
\[LHS = S_1 = 1^2 = 1\]
\[RHS = S_1 = \frac{1^2 \left( 1 + 1 \right)}{2} = 1\]
\[\text{ As, LHS = RHS } \]
\[\text{ So, it is true for n } = 1 . \]
\[ \text{ Step II: For n } = k, \]
\[\text{ Let } P\left( k \right): S_k = 1^2 + 2 \times 2^2 + 3^2 + 2 \times 4^2 + 5^2 + . . . = \binom{\frac{k \left( k + 1 \right)^2}{2}, \text{ when k is even} }{\frac{k^2 \left( k + 1 \right)}{2}, \text{ when k is odd }}, \text{ be true for some natural numbers } . \]
\[\text{ Step III: For } n = k + 1, \]
\[\text{ Case 1: When k is odd, then } \left( k + 1 \right) \text{ is even .} \]
\[P\left( k + 1 \right): \]
\[LHS = S_{k + 1} = 1^2 + 2 \times 2^2 + 3^2 + 2 \times 4^2 + 5^2 + . . . + k^2 + 2 \times \left( k + 1 \right)^2 \]
\[ = \frac{k^2 \left( k + 1 \right)}{2} + 2 \times \left( k + 1 \right)^2 \left( \text{ Using step } II \right)\]
\[ = \frac{k^2 \left( k + 1 \right) + 4 \left( k + 1 \right)^2}{2}\]
\[ = \frac{\left( k + 1 \right)\left( k^2 + 4k + 4 \right)}{2}\]
\[ = \frac{\left( k + 1 \right) \left( k + 2 \right)^2}{2}\]
\[RHS = \frac{\left( k + 1 \right) \left( k + 1 + 1 \right)^2}{2}\]
\[ = \frac{\left( k + 1 \right) \left( k + 2 \right)^2}{2}\]
\[\text{ As, LHS = RHS } \]
\[\text{ So, it is true for n = k + 1 when k is odd .} \]
\[\text{ Case 2: When k is even, then } \left( k + 1 \right) \text{ is odd .} \]
\[P\left( k + 1 \right): \]
\[RHS = S_{k + 1} = 1^2 + 2 \times 2^2 + 3^2 + 2 \times 4^2 + 5^2 + . . . + 2 \times k^2 + \left( k + 1 \right)^2 \]
\[ = \frac{k \left( k + 1 \right)^2}{2} + \left( k + 1 \right)^2 \left( \text{ Using step } II \right)\]
\[ = \frac{k \left( k + 1 \right)^2 + 2 \left( k + 1 \right)^2}{2}\]
\[ = \frac{\left( k + 1 \right)^2 \left( k + 2 \right)}{2}\]
\[ = \frac{\left( k + 1 \right)^2 \left( k + 2 \right)}{2}\]
\[RHS = \frac{\left( k + 1 \right)^2 \left( k + 1 + 1 \right)}{2}\]
\[ = \frac{\left( k + 1 \right)^2 \left( k + 2 \right)}{2}\]
\[As, LHS = RHS\]
\[\text{ So, it is true for n = k + 1 when k is even } . \]
\[\text{ Hence, } P\left( n \right) \text{ is true for all natural numbers .} \]
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:
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 (2n +7) < (n + 3)2
If P (n) is the statement "n(n + 1) is even", then what is P(3)?
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 + 5 + ... + (2n − 1) = n2 i.e., the sum of first n odd natural numbers is n2.
1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]
12 + 32 + 52 + ... + (2n − 1)2 = \[\frac{1}{3}n(4 n^2 - 1)\]
Prove that 1 + 2 + 22 + ... + 2n = 2n+1 - 1 for all n \[\in\] N .
x2n−1 + y2n−1 is divisible by x + y for all n ∈ N.
\[\text{ The distributive law from algebra states that for all real numbers} c, a_1 \text{ and } a_2 , \text{ we have } c\left( a_1 + a_2 \right) = c a_1 + c a_2 . \]
\[\text{ Use this law and mathematical induction to prove that, for all natural numbers, } n \geq 2, if c, a_1 , a_2 , . . . , a_n \text{ are any real numbers, then } \]
\[c\left( a_1 + a_2 + . . . + a_n \right) = c a_1 + c a_2 + . . . + c a_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:
`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:
(cos θ + i sin θ)n = cos (nθ) + i sin (nθ)
Prove by method of induction, for all n ∈ N:
`[(1, 2),(0, 1)]^"n" = [(1, 2"n"),(0, 1)]` ∀ n ∈ N
Answer the following:
Given that tn+1 = 5tn − 8, t1 = 3, prove by method of induction that tn = 5n−1 + 2
Answer the following:
Prove by method of induction 152n–1 + 1 is divisible by 16, for all n ∈ N.
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))`
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:
4n – 1 is divisible by 3, for each natural number n.
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:
2 + 4 + 6 + ... + 2n = n2 + n for all natural numbers n.
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.
Show that `n^5/5 + n^3/3 + (7n)/15` is a natural number for all n ∈ N.
Prove that `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.
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 ______.
By using principle of mathematical induction for every natural number, (ab)n = ______.
