Advertisements
Advertisements
प्रश्न
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)`
Advertisements
उत्तर
Let P(n) ≡ 1.3 + 3.5 + 5.7 + ..... to n terms = `"n"/3(4"n"^2 + 6"n" - 1)`, for all n ∈ N
But the first factor in each term
i.e., 1, 3, 5 … are in A.P. with a = 1 and d = 2.
∴ nth term = a + (n –1)d = 1 +(n – 1)2 = (2n – 1)
Also second factor in each term
i.e., 3, 5, 7, … are in A.P. with a = 3 and d = 2.
∴ nth term = a + (n – 1)d = 3 + (n – 1)2 = (2n+1)
∴ nth term, tn = (2n – 1) (2n + 1)
∴ P(n) ≡ 1.3 + 3.5 + 5.7 + .... + (2n – 1) (2n + 1) = `"n"/3(4"n"^2 + 6"n" - 1)`
Step I:
Put n = 1
L.H.S. = 1.3 = 3
R.H.S. = `1/3[4(1)^2 + 6(1) - 1]` = 3 = L.H.S.
∴ P(n) is true for n = 1.
Step II:
Let us consider that P(n) is true for n = k
∴ 1.3 + 3.5 + 5.7 + ..... + (2k – 1)(2k + 1)
= `"k"/3(4"k"^2 + 6"k" - 1)` ...(i)
Step III:
We have to prove that P(n) is true for n = k + 1
i.e., to prove that
1.3 + 3.5 + 5.7 + …. + [2(k + 1) – 1][2(k + 1) + 1]
= `(("k" + 1))/3[4("k" + 1)^2 + 6("k" + 1) - 1]`
= `(("k" + 1))/3(4"k"^2 + 8"k" + 4 + 6"k" + 6 - 1)`
= `(("k" + 1))/3(4"k"^2 + 14"k" + 9)`
L.H.S. = 1.3 + 3.5 + 5.7 + ... + [2(k + 1) – 1][2(k + 1) + 1]
= 1.3 + 3.5 + 5.7 + ... + (2k – 1)(2k + 1) + (2k + 1)(2k + 3)
= `"k"/3(4"k"^2 + 6"k" - 1) + (2"k" + 1) (2"k" + 3)` ...[From (i)]
= `1/3[4"k"^3 + 6"k"^2 - "k" + 3(2"k" + 1)(2"k" + 3)]`
= `1/3(4"k"^3 + 6"k"^2 - "k" + 12"k"^2 + 24"k" + 9)`
= `1/3(4"k"^3 + 18"k"^2 + 23"k" + 9)`
= `1/3("k" + 1)(4"k"^2 + 14"k" + 9)`
= R.H.S.
∴ P(n) is true for n = k + 1
Step IV:
From all steps above by the principle of mathematical induction, P(n) is true for all n ∈ N.
∴ 1.3 + 3.5 + 5.7 + ..... to n terms = `"n"/3(4"n"^2 + 6"n" - 1)` for all n ∈ N.
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: `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:
If P (n) is the statement "n3 + n is divisible by 3", prove that P (3) is true but P (4) is not true.
1.2 + 2.22 + 3.23 + ... + n.2n = (n − 1) 2n+1+2
2 + 5 + 8 + 11 + ... + (3n − 1) = \[\frac{1}{2}n(3n + 1)\]
a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]
(ab)n = anbn for all n ∈ N.
72n + 23n−3. 3n−1 is divisible by 25 for all n ∈ N.
2.7n + 3.5n − 5 is divisible by 24 for all n ∈ N.
Prove that 1 + 2 + 22 + ... + 2n = 2n+1 - 1 for all n \[\in\] N .
\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\] 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 } x_0 , x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_0 = 5 and x_k = 4 + x_{k - 1}\text{ for all natural number k . } \]
\[\text{ Show that } x_n = 5 + 4n \text{ for all n } \in N \text{ using mathematical induction .} \]
Prove by method of induction, for all n ∈ N:
(24n−1) is divisible by 15
Prove by method of induction, for all n ∈ N:
5 + 52 + 53 + .... + 5n = `5/4(5^"n" - 1)`
Answer the following:
Prove by method of induction
`[(3, -4),(1, -1)]^"n" = [(2"n" + 1, -4"n"),("n", -2"n" + 1)], ∀ "n" ∈ "N"`
Answer the following:
Prove by method of induction 152n–1 + 1 is divisible by 16, for all 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:
`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 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))`
Prove by the Principle of Mathematical Induction that 1 × 1! + 2 × 2! + 3 × 3! + ... + n × n! = (n + 1)! – 1 for all natural numbers n.
Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.
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`
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:
32n – 1 is divisible by 8, for all natural numbers 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 the statement by using the Principle of Mathematical Induction:
n(n2 + 5) is divisible by 6, for each natural number n.
Prove the statement by using the Principle of Mathematical Induction:
2n < (n + 2)! for all natural number n.
Prove that, cosθ cos2θ cos22θ ... cos2n–1θ = `(sin 2^n theta)/(2^n sin theta)`, for all n ∈ N.
If 10n + 3.4n+2 + k is divisible by 9 for all n ∈ N, then the least positive integral value of k is ______.
For all n ∈ N, 3.52n+1 + 23n+1 is divisible by ______.
