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: 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+2+ 3+...+n<1/8(2n +1)^2`
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 "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.
If P (n) is the statement "n2 − n + 41 is prime", prove that P (1), P (2) and P (3) are true. Prove also that P (41) is not true.
1 + 2 + 3 + ... + n = \[\frac{n(n + 1)}{2}\] i.e. the sum of the first n natural numbers is \[\frac{n(n + 1)}{2}\] .
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}\]
\[\frac{1}{1 . 4} + \frac{1}{4 . 7} + \frac{1}{7 . 10} + . . . + \frac{1}{(3n - 2)(3n + 1)} = \frac{n}{3n + 1}\]
\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 5} + . . . + \frac{1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\]
32n+2 −8n − 9 is divisible by 8 for all n ∈ N.
(ab)n = anbn for all n ∈ N.
11n+2 + 122n+1 is divisible by 133 for all n ∈ N.
Let P(n) be the statement : 2n ≥ 3n. If P(r) is true, show that P(r + 1) is true. Do you conclude that P(n) is true 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_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:
12 + 32 + 52 + .... + (2n − 1)2 = `"n"/3 (2"n" − 1)(2"n" + 1)`
Prove by method of induction, for all n ∈ N:
`1/(1.3) + 1/(3.5) + 1/(5.7) + ... + 1/((2"n" - 1)(2"n" + 1)) = "n"/(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
Answer the following:
Prove by method of induction loga xn = n logax, x > 0, n ∈ N
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
2n + 1 < 2n, for all natual numbers n ≥ 3.
Define the sequence a1, a2, a3 ... as follows:
a1 = 2, an = 5 an–1, for all natural numbers n ≥ 2.
Use the Principle of Mathematical Induction to show that the terms of the sequence satisfy the formula an = 2.5n–1 for all natural numbers.
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.
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:
2 + 4 + 6 + ... + 2n = n2 + n for all natural numbers n.
Prove the statement by using the Principle of Mathematical Induction:
1 + 2 + 22 + ... + 2n = 2n+1 – 1 for all natural numbers n.
A sequence d1, d2, d3 ... is defined by letting d1 = 2 and dk = `(d_(k - 1))/"k"` for all natural numbers, k ≥ 2. Show that dn = `2/(n!)` for all n ∈ N.
Prove that, cosθ cos2θ cos22θ ... cos2n–1θ = `(sin 2^n theta)/(2^n sin theta)`, for all n ∈ N.
For all n ∈ N, 3.52n+1 + 23n+1 is divisible by ______.
Consider the statement: “P(n) : n2 – n + 41 is prime." Then which one of the following is true?
By using principle of mathematical induction for every natural number, (ab)n = ______.
