Advertisements
Advertisements
प्रश्न
Prove by method of induction, for all n ∈ N:
13 + 33 + 53 + .... to n terms = n2(2n2 − 1)
Advertisements
उत्तर
Let P(n) ≡ 13 + 33 + 53 + .... to n terms = n2(2n2 − 1), for all n ∈ N
But 1, 3, 5, …… are in A.P.
∴ a = 1, d = 2
Let tn be the nth term
∴ tn = a + (n − 1)d = 1 + (n − 1)2 = 2n − 1
∴ P(n) ≡ 13 + 33 + 53 + …. + (2n − 1)3 = n2(2n2 − 1)
Step I:
Put n = 1
L.H.S. = 13 = 1
R.H.S. = 12 [2(1)2 − 1] = 1 = L.H.S.
∴ P(n) is true for n = 1.
Step II:
Let us consider that P(n) is true for n = k
∴ 13 + 33 + 53 + … + (2k − 1)3 = k2(2k2 − 1) …(i)
Step III:
We have to prove that P(n) is true for n = k + 1
i.e., to prove that
13 + 33 + 53 + .… + [2(k + 1) − 1]3
= (k + 1)2 [2(k + 1)2 – 1]
= (k2 + 2k + 1) (2k2 + 4k + 1)
L.H.S. = 13 + 33 + 53 + .… + [2(k + 1) − 1]3
= 13 + 33 + 53 + … + (2k − 1)3 + (2k + 1)3
= k2 (2k2 − 1) + (2k + 1)3 …[From (i)]
= 2k4 − k2 + 8k3 + 12k2 + 6k + 1
= 2k4 + 8k3 + 11k2 + 6k + 1
= 2k2 (k2 + 2k + 1) + 4k3 + 9k2 + 6k + 1
= 2k2 (k2 + 2k + 1)+ 4k (k2 + 2k + 1) + (k2 + 2k + 1)
= (k2 + 2k + 1) (2k2 + 4k + 1)
= 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.
∴ 13 + 33 + 53 + .... to n terms = n2(2n2 − 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.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:
Prove the following by using the principle of mathematical induction for all n ∈ N:
(1+3/1)(1+ 5/4)(1+7/9)...`(1 + ((2n + 1))/n^2) = (n + 1)^2`
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:
`1/1.4 + 1/4.7 + 1/7.10 + ... + 1/((3n - 2)(3n + 1)) = n/((3n + 1))`
Prove the following by using the principle of mathematical induction for all n ∈ N: 41n – 14n is a multiple of 27.
If P (n) is the statement "n2 + n is even", and if P (r) is true, then P (r + 1) is true.
Given an example of a statement P (n) such that it is true for all n ∈ N.
1 + 3 + 32 + ... + 3n−1 = \[\frac{3^n - 1}{2}\]
\[\frac{1}{1 . 2} + \frac{1}{2 . 3} + \frac{1}{3 . 4} + . . . + \frac{1}{n(n + 1)} = \frac{n}{n + 1}\]
1.2 + 2.22 + 3.23 + ... + n.2n = (n − 1) 2n+1+2
n(n + 1) (n + 5) is a multiple of 3 for all n ∈ N.
\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\] for all n ∈ 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 + 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:
(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)`
Answer the following:
Prove, by method of induction, for all n ∈ N
2 + 3.2 + 4.22 + ... + (n + 1)2n–1 = n.2n
Answer the following:
Prove, by method of induction, for all n ∈ N
`1/(3.4.5) + 2/(4.5.6) + 3/(5.6.7) + ... + "n"/(("n" + 2)("n" + 3)("n" + 4)) = ("n"("n" + 1))/(6("n" + 3)("n" + 4))`
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
`(1 - 1/2^2).(1 - 1/3^2)...(1 - 1/n^2) = (n + 1)/(2n)`, for all natural numbers, n ≥ 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 ______.
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:
`sqrt(n) < 1/sqrt(1) + 1/sqrt(2) + ... + 1/sqrt(n)`, for all natural numbers 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 + 5 + 9 + ... + (4n – 3) = n(2n – 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 for all n ∈ N.
cos α + cos(α + β) + cos(α + 2β) + ... + cos(α + (n – 1)β) = `(cos(alpha + ((n - 1)/2)beta)sin((nbeta)/2))/(sin beta/2)`.
Prove that, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin ((n + 1))/2 theta)/(sin theta/2)`, 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 ______.
If xn – 1 is divisible by x – k, then the least positive integral value of k is ______.
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.
