Advertisements
Advertisements
प्रश्न
1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]
Advertisements
उत्तर
Let P(n) be the given statement.
Now,
\[P(n) = 1 . 3 + 3 . 5 + 5 . 7 + . . . + (2n - 1)(2n + 1) = \frac{n(4 n^2 + 6n - 1)}{3}\]
\[\text{ Step } 1: \]
\[P(1) = 1 . 3 = 3 = \frac{1(4 \times \left( 1 \right)^2 + 6 \times 1 - 1)}{3}\]
\[\text{ Hence, P(1) is true } . \]
\[\text{ Step 2: } \]
\[\text{ Let P(m) be true} . \]
\[\text{ Then,} \]
\[1 . 3 + 3 . 5 + . . . + (2m - 1)(2m + 1) = \frac{m(4 m^2 + 6m - 1)}{3}\]
\[\text{ To prove: P(m + 1) is true} . \]
\[\text{ That is, } \]
\[1 . 3 + 3 . 5 + . . . + (2m + 1)(2m + 3) = \frac{(m + 1)\left[ 4(m + 1 )^2 + 6\left( m + 1 \right) - 1 \right]}{3}\]
\[ \text{ Now, P(m) is equal to: } \]
\[1 . 3 + 3 . 5 + . . . + (2m - 1)(2m + 1) = \frac{m(4 m^2 + 6m - 1)}{3}\]
\[ \Rightarrow 1 . 3 + 3 . 5 + . . . + (2m - 1)(2m + 1) + (2m + 1)(2m + 3) = \frac{m(4 m^2 + 6m - 1)}{3} + (2m + 1)(2m + 3) \left[ \text{ Adding } (2m + 1)(2m + 3) \text{ to both sides } \right]\]
\[ \Rightarrow P(m + 1) = \frac{m(4 m^2 + 6m - 1) + 3(4 m^2 + 8m + 3)}{3}\]
\[ \Rightarrow P(m + 1) = \frac{4 m^3 + 6 m^2 - m + 12 m^2 + 24m + 9}{3} = \frac{4 m^3 + 18 m^2 + 23m + 9}{3}\]
\[ \Rightarrow P(m + 1) = \frac{4m( m^2 + 2m + 1) + 10 m^2 + 19m + 9}{3}\]
\[ = \frac{4m(m + 1 )^2 + (10m + 9)(m + 1)}{3}\]
\[ = \frac{(m + 1)\left[ 4m(m + 1) + 10m + 9 \right]}{3}\]
\[ = \frac{(m + 1)}{3}(4 m^2 + 8m + 4 + 6m + 5)\]
\[ = \frac{(m + 1)\left[ 4(m + 1 )^2 + 6\left( m + 1 \right) - 1 \right]}{3}\]
\[\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: 1.2.3 + 2.3.4 + … + n(n + 1) (n + 2) = `(n(n+1)(n+2)(n+3))/(4(n+3))`
Prove the following by using the principle of mathematical induction for all n ∈ N:
1.2 + 2.3 + 3.4+ ... + n(n+1) = `[(n(n+1)(n+2))/3]`
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: `1+2+ 3+...+n<1/8(2n +1)^2`
Prove the following by using the principle of mathematical induction for all n ∈ N: 102n – 1 + 1 is divisible by 11
If P (n) is the statement "n(n + 1) is even", then what is P(3)?
If P (n) is the statement "n3 + n is divisible by 3", prove that P (3) is true but P (4) is not true.
If P (n) is the statement "2n ≥ 3n" and if P (r) is true, prove that P (r + 1) is true.
If P (n) is the statement "n2 + n is even", and if P (r) is true, then P (r + 1) is true.
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}\]
\[\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]
52n −1 is divisible by 24 for all n ∈ N.
11n+2 + 122n+1 is divisible by 133 for all n ∈ N.
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 } }\]
\[\text{ A sequence } a_1 , a_2 , a_3 , . . . \text{ is defined by letting } a_1 = 3 \text{ and } a_k = 7 a_{k - 1} \text{ for all natural numbers } k \geq 2 . \text{ Show that } a_n = 3 \cdot 7^{n - 1} \text{ for all } n \in N .\]
\[\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:
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 + 22 + 32 + .... + n2 = `("n"("n" + 1)(2"n" + 1))/6`
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.2 + 2.3 + 3.4 + ..... + n(n + 1) = `"n"/3 ("n" + 1)("n" + 2)`
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
8 + 17 + 26 + … + (9n – 1) = `"n"/2(9"n" + 7)`
Answer the following:
Prove, by method of induction, for all n ∈ N
12 + 42 + 72 + ... + (3n − 2)2 = `"n"/2 (6"n"^2 - 3"n" - 1)`
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
22n – 1 is divisible by 3.
Show by the Principle of Mathematical Induction that the sum Sn of the n term of the series 12 + 2 × 22 + 32 + 2 × 42 + 52 + 2 × 62 ... is given by
Sn = `{{:((n(n + 1)^2)/2",", "if n is even"),((n^2(n + 1))/2",", "if n is odd"):}`
Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.
Give an example of a statement P(n) which is true for all n. Justify your answer.
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:
n2 < 2n for all natural numbers n ≥ 5.
Prove that, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin ((n + 1))/2 theta)/(sin theta/2)`, for all n ∈ N.
Show that `n^5/5 + n^3/3 + (7n)/15` is a natural number for all n ∈ N.
By using principle of mathematical induction for every natural number, (ab)n = ______.
