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:
`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:
`(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)?
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}\] .
12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .
\[\frac{1}{1 . 2} + \frac{1}{2 . 3} + \frac{1}{3 . 4} + . . . + \frac{1}{n(n + 1)} = \frac{n}{n + 1}\]
1 + 3 + 5 + ... + (2n − 1) = n2 i.e., the sum of first n odd natural numbers is n2.
\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]
\[\frac{1}{1 . 4} + \frac{1}{4 . 7} + \frac{1}{7 . 10} + . . . + \frac{1}{(3n - 2)(3n + 1)} = \frac{n}{3n + 1}\]
52n+2 −24n −25 is divisible by 576 for all n ∈ N.
72n + 23n−3. 3n−1 is divisible by 25 for all n ∈ N.
\[\text{ 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) \text{ for } n \geq 2, \text{ where } a > 0, A > 0 . \]
\[\text{ 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} .\]
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:
13 + 33 + 53 + .... to n terms = n2(2n2 − 1)
Prove by method of induction, for all n ∈ N:
`1/(1.3) + 1/(3.5) + 1/(5.7) + ... + 1/((2"n" - 1)(2"n" + 1)) = "n"/(2"n" + 1)`
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:
Given that tn+1 = 5tn + 4, t1 = 4, prove that tn = 5n − 1
Answer the following:
Prove by method of induction loga xn = n logax, x > 0, n ∈ N
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:
1 + 3 + 5 + ... + (2n – 1) = n2
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:
22n – 1 is divisible by 3.
The distributive law from algebra says that for all real numbers c, a1 and a2, we have c(a1 + a2) = ca1 + ca2.
Use this law and mathematical induction to prove that, for all natural numbers, n ≥ 2, if c, a1, a2, ..., an are any real numbers, then c(a1 + a2 + ... + an) = ca1 + ca2 + ... + can.
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 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:
2 + 4 + 6 + ... + 2n = n2 + n for all natural numbers n.
Prove the statement by using the Principle of Mathematical Induction:
1 + 2 + 22 + ... + 2n = 2n+1 – 1 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.
Prove that number of subsets of a set containing n distinct elements is 2n, for all n ∈ N.
