Advertisements
Advertisements
प्रश्न
12 + 32 + 52 + ... + (2n − 1)2 = \[\frac{1}{3}n(4 n^2 - 1)\]
Advertisements
उत्तर
Let P(n) be the given statement.
Now,
\[P(n) = 1^2 + 3^2 + 5^2 + . . . + (2n - 1 )^2 = \frac{1}{3}n(4 n^2 - 1)\]
\[\text{ Step 1:} \]
\[P(1) = 1^2 = 1 = \frac{1}{3} \times 1 \times (4 - 1)\]
\[\text{ Hence, P(1) is true } . \]
\[\text{ Step 2: } \]
\[\text{ Let P(m) be true } . \]
\[\text{ Then, } \]
\[ 1^2 + 3^2 + . . . + (2m - 1 )^2 = \frac{1}{3}m(4 m^2 - 1)\]
\[\text{ To prove: P(m + 1) is true whenever P(m) is true } . \]
\[\text{ That is, } \]
\[ 1^2 + 3^2 = . . . + (2m + 1 )^2 = \frac{1}{3}(m + 1)\left\{ 4(m + 1 )^2 - 1 \right\}\]
\[\text{ We know that P(m) is true } . \]
\[\text{ Thus, we have: } \]
\[ 1^2 + 3^2 + . . . + (2m - 1 )^2 = \frac{1}{3}m(4 m^2 - 1)\]
\[ \Rightarrow 1^2 + 3^2 + . . . + (2m - 1 )^2 + (2m + 1 )^2 = \frac{1}{3}m(4 m^2 - 1) + (2m + 1 )^2 \left[ \text{ Adding } (2m + 1 )^2 \text{ to both sides } \right]\]
\[ \Rightarrow P(m + 1) = \frac{1}{3}\left( 4 m^3 - m + 12 m^2 + 12m + 3 \right)\]
\[ \Rightarrow P(m + 1) = \frac{1}{3}(4 m^3 - m + 8 m^2 + 4m + 4 m^2 + 8m + 3)\]
\[ = \frac{1}{3}(m + 1)(4 m^2 + 8m + 3) \]
\[ = \frac{1}{3}(m + 1)(4(m + 1 )^2 - 1)\]
\[\text{ Thus, P(m + 1) is true } . \]
\[\text{ By the principle of mathematical induction, P(n) is true for all n } \in N . \]
APPEARS IN
संबंधित प्रश्न
Prove the following by using the principle of mathematical induction for all n ∈ N:
1.2 + 2.3 + 3.4+ ... + n(n+1) = `[(n(n+1)(n+2))/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:
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: n (n + 1) (n + 5) is a multiple of 3.
Prove the following by using the principle of mathematical induction for all n ∈ N (2n +7) < (n + 3)2
If P (n) is the statement "2n ≥ 3n" and if P (r) is true, prove that P (r + 1) is true.
\[\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 . 5} + \frac{1}{5 . 7} + \frac{1}{7 . 9} + . . . + \frac{1}{(2n + 1)(2n + 3)} = \frac{n}{3(2n + 3)}\]
a + ar + ar2 + ... + arn−1 = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]
11n+2 + 122n+1 is divisible by 133 for all n ∈ N.
Prove that 1 + 2 + 22 + ... + 2n = 2n+1 - 1 for all n \[\in\] N .
x2n−1 + y2n−1 is divisible by x + y for all n ∈ N.
Prove that the number of subsets of a set containing n distinct elements is 2n, for all n \[\in\] N .
\[\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:
3 + 7 + 11 + ..... + to n terms = n(2n+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)`
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))`
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 52n − 22n is divisible by 3, for all n ∈ N
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.
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.
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:
32n – 1 is divisible by 8, 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 + 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.
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)`.
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.
Consider the statement: “P(n) : n2 – n + 41 is prime." Then which one of the following is true?
