Advertisements
Advertisements
Question
Prove by method of induction, for all n ∈ N:
13 + 33 + 53 + .... to n terms = n2(2n2 − 1)
Advertisements
Solution
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
RELATED QUESTIONS
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: 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.
\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]
\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 5} + . . . + \frac{1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\]
1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]
11n+2 + 122n+1 is divisible by 133 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} .\]
\[\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 .\]
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:
1.3 + 3.5 + 5.7 + ..... to n terms = `"n"/3(4"n"^2 + 6"n" - 1)`
Prove by method of induction, for all n ∈ N:
`1/(3.5) + 1/(5.7) + 1/(7.9) + ...` to n terms = `"n"/(3(2"n" + 3))`
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, 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 + 3 + 5 + ... + (2n – 1) = n2
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
2n + 1 < 2n, for all natual numbers n ≥ 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.
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:
23n – 1 is divisible by 7, for all natural numbers n.
Prove the statement by using the Principle of Mathematical Induction:
n3 – 7n + 3 is divisible by 3, for all natural numbers n.
Prove the statement by using the Principle of Mathematical Induction:
n2 < 2n for all natural numbers n ≥ 5.
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:
1 + 2 + 22 + ... + 2n = 2n+1 – 1 for all natural numbers n.
Prove that, cosθ cos2θ cos22θ ... cos2n–1θ = `(sin 2^n theta)/(2^n sin theta)`, for all n ∈ N.
Prove that `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.
Prove that number of subsets of a set containing n distinct elements is 2n, for all n ∈ N.
If xn – 1 is divisible by x – k, then the least positive integral value of k is ______.
