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 + 3^2 + ... + 3^(n – 1) =((3^n -1))/2`
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+2+ 3+...+n<1/8(2n +1)^2`
Prove the following by using the principle of mathematical induction for all n ∈ N: 32n + 2 – 8n– 9 is divisible by 8.
If P (n) is the statement "n(n + 1) is even", then what is P(3)?
12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .
1 + 3 + 32 + ... + 3n−1 = \[\frac{3^n - 1}{2}\]
1 + 3 + 5 + ... + (2n − 1) = n2 i.e., the sum of first n odd natural numbers is n2.
32n+7 is divisible by 8 for all n ∈ N.
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.
x2n−1 + y2n−1 is divisible by x + y for all n ∈ N.
\[\text{ Let } P\left( n \right) \text{ be the statement } : 2^n \geq 3n . \text{ If } P\left( r \right) \text{ is true, then show that } P\left( r + 1 \right) \text{ is true . Do you conclude that } P\left( n \right)\text{ is true 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:
12 + 32 + 52 + .... + (2n − 1)2 = `"n"/3 (2"n" − 1)(2"n" + 1)`
Prove by method of induction, for all n ∈ N:
(23n − 1) is divisible by 7
Prove by method of induction, for all n ∈ N:
3n − 2n − 1 is divisible by 4
Prove by method of induction, for all n ∈ N:
5 + 52 + 53 + .... + 5n = `5/4(5^"n" - 1)`
Prove by method of induction, for all n ∈ N:
(cos θ + i sin θ)n = cos (nθ) + i sin (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 by the Principle of Mathematical Induction that 1 × 1! + 2 × 2! + 3 × 3! + ... + n × n! = (n + 1)! – 1 for all natural numbers n.
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"):}`
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, 7n – 2n is divisible by 5.
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.
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, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin ((n + 1))/2 theta)/(sin theta/2)`, for all n ∈ N.
If P(n): 2n < n!, n ∈ N, then P(n) is true for all n ≥ ______.
State whether the following statement is true or false. Justify.
Let P(n) be a statement and let P(k) ⇒ P(k + 1), for some natural number k, then P(n) is true for all n ∈ N.
By using principle of mathematical induction for every natural number, (ab)n = ______.
