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:
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 "2n ≥ 3n" and if P (r) is true, prove that P (r + 1) is 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}\] .
\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]
1.3 + 2.4 + 3.5 + ... + n. (n + 2) = \[\frac{1}{6}n(n + 1)(2n + 7)\]
1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]
32n+2 −8n − 9 is divisible by 8 for all n ∈ N.
(ab)n = anbn for all n ∈ N.
x2n−1 + y2n−1 is divisible by x + y 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:
13 + 33 + 53 + .... to n terms = n2(2n2 − 1)
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)`
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:
`[(1, 2),(0, 1)]^"n" = [(1, 2"n"),(0, 1)]` ∀ n ∈ N
Answer the following:
Prove, by method of induction, for all n ∈ N
8 + 17 + 26 + … + (9n – 1) = `"n"/2(9"n" + 7)`
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.
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:
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:
1 + 2 + 22 + ... + 2n = 2n+1 – 1 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 a1, a2, a3 ... is defined by letting a1 = 3 and ak = 7ak – 1 for all natural numbers k ≥ 2. Show that an = 3.7n–1 for all natural numbers.
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 number of subsets of a set containing n distinct elements is 2n, for all n ∈ N.
By using principle of mathematical induction for every natural number, (ab)n = ______.
