Advertisements
Advertisements
Question
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 } }\]
Advertisements
Solution
\[ \text{ Let } P\left( n \right): S_n = 1^2 + 2 \times 2^2 + 3^2 + 2 \times 4^2 + 5^2 + . . . = \binom{\frac{n \left( n + 1 \right)^2}{2}, \text{ when n is even } }{\frac{n^2 \left( n + 1 \right)}{2}, \text{ when n is odd} }\]
\[\text{ Step I: For } n = 1 i . e . P\left( 1 \right): \]
\[LHS = S_1 = 1^2 = 1\]
\[RHS = S_1 = \frac{1^2 \left( 1 + 1 \right)}{2} = 1\]
\[\text{ As, LHS = RHS } \]
\[\text{ So, it is true for n } = 1 . \]
\[ \text{ Step II: For n } = k, \]
\[\text{ Let } P\left( k \right): S_k = 1^2 + 2 \times 2^2 + 3^2 + 2 \times 4^2 + 5^2 + . . . = \binom{\frac{k \left( k + 1 \right)^2}{2}, \text{ when k is even} }{\frac{k^2 \left( k + 1 \right)}{2}, \text{ when k is odd }}, \text{ be true for some natural numbers } . \]
\[\text{ Step III: For } n = k + 1, \]
\[\text{ Case 1: When k is odd, then } \left( k + 1 \right) \text{ is even .} \]
\[P\left( k + 1 \right): \]
\[LHS = S_{k + 1} = 1^2 + 2 \times 2^2 + 3^2 + 2 \times 4^2 + 5^2 + . . . + k^2 + 2 \times \left( k + 1 \right)^2 \]
\[ = \frac{k^2 \left( k + 1 \right)}{2} + 2 \times \left( k + 1 \right)^2 \left( \text{ Using step } II \right)\]
\[ = \frac{k^2 \left( k + 1 \right) + 4 \left( k + 1 \right)^2}{2}\]
\[ = \frac{\left( k + 1 \right)\left( k^2 + 4k + 4 \right)}{2}\]
\[ = \frac{\left( k + 1 \right) \left( k + 2 \right)^2}{2}\]
\[RHS = \frac{\left( k + 1 \right) \left( k + 1 + 1 \right)^2}{2}\]
\[ = \frac{\left( k + 1 \right) \left( k + 2 \right)^2}{2}\]
\[\text{ As, LHS = RHS } \]
\[\text{ So, it is true for n = k + 1 when k is odd .} \]
\[\text{ Case 2: When k is even, then } \left( k + 1 \right) \text{ is odd .} \]
\[P\left( k + 1 \right): \]
\[RHS = S_{k + 1} = 1^2 + 2 \times 2^2 + 3^2 + 2 \times 4^2 + 5^2 + . . . + 2 \times k^2 + \left( k + 1 \right)^2 \]
\[ = \frac{k \left( k + 1 \right)^2}{2} + \left( k + 1 \right)^2 \left( \text{ Using step } II \right)\]
\[ = \frac{k \left( k + 1 \right)^2 + 2 \left( k + 1 \right)^2}{2}\]
\[ = \frac{\left( k + 1 \right)^2 \left( k + 2 \right)}{2}\]
\[ = \frac{\left( k + 1 \right)^2 \left( k + 2 \right)}{2}\]
\[RHS = \frac{\left( k + 1 \right)^2 \left( k + 1 + 1 \right)}{2}\]
\[ = \frac{\left( k + 1 \right)^2 \left( k + 2 \right)}{2}\]
\[As, LHS = RHS\]
\[\text{ So, it is true for n = k + 1 when k is even } . \]
\[\text{ Hence, } P\left( n \right) \text{ is true for all natural numbers .} \]
APPEARS IN
RELATED QUESTIONS
Prove the following by using the principle of mathematical induction for all n ∈ N:
`1 + 3 + 3^2 + ... + 3^(n – 1) =((3^n -1))/2`
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 + 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: n (n + 1) (n + 5) is a multiple of 3.
Prove the following by using the principle of mathematical induction for all n ∈ N: x2n – y2n is divisible by x + y.
Prove the following by using the principle of mathematical induction for all n ∈ N: 32n + 2 – 8n– 9 is divisible by 8.
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 "n3 + n is divisible by 3", prove that P (3) is true but P (4) is not true.
Given an example of a statement P (n) such that it is true for all n ∈ N.
Give an example of a statement P(n) which is true for all n ≥ 4 but P(1), P(2) and P(3) are not true. Justify your answer.
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}{1 . 2} + \frac{1}{2 . 3} + \frac{1}{3 . 4} + . . . + \frac{1}{n(n + 1)} = \frac{n}{n + 1}\]
\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]
a + ar + ar2 + ... + arn−1 = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]
32n+7 is divisible by 8 for all n ∈ N.
(ab)n = anbn for all n ∈ N.
n(n + 1) (n + 5) is a multiple of 3 for all n ∈ N.
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
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 52n − 22n is divisible by 3, for all n ∈ N
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:
n3 – 7n + 3 is divisible by 3, for all natural numbers n.
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 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, cosθ cos2θ cos22θ ... cos2n–1θ = `(sin 2^n theta)/(2^n sin theta)`, for all n ∈ N.
Prove that, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin ((n + 1))/2 theta)/(sin theta/2)`, for all n ∈ N.
If P(n): 2n < n!, n ∈ N, then P(n) is true for all n ≥ ______.
