Advertisements
Advertisements
Question
Advertisements
Solution
\[\text{ Let p } \left( n \right): \cos\alpha + \cos\left( \alpha + \beta \right) + \cos\left( \alpha + 2\beta \right) + . . . + \cos\left[ \alpha + \left( n - 1 \right)\beta \right] = \frac{\cos\left\{ \alpha + \left( \frac{n - 1}{2} \right)\beta \right\}\sin\left( \frac{n\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)} \forall n \in N . \]
\[\text{ Step I: For } n = 1, \]
\[LHS = \cos\left[ \alpha + \left( 1 - 1 \right)\beta \right] = \cos\alpha\]
\[RHS = \frac{\cos\left\{ \alpha + \left( \frac{1 - 1}{2} \right)\beta \right\}\sin\left( \frac{\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)} = \cos\alpha\]
\[\text{ As, LHS = RHS } \]
\[\text{ So, it is true for n = 1 .} \]
\[\text{ Step II: For n = k,} \]
\[ \text{ Let } p\left( k \right): \cos\alpha + \cos\left( \alpha + \beta \right) + \cos\left( \alpha + 2\beta \right) + . . . + \cos\left[ \alpha + \left( k - 1 \right)\beta \right] = \frac{\cos\left\{ \alpha + \left( \frac{k - 1}{2} \right)\beta \right\}\sin\left( \frac{k\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)} \text{ be true } \forall k \in N . \]
\[\text{ Step III: For n } = k + 1, \]
\[LHS = \cos\alpha + \cos\left( \alpha + \beta \right) + \cos\left( \alpha + 2\beta \right) + . . . + \cos\left[ \alpha + \left( k - 1 \right)\beta \right] + \cos\left[ \alpha + \left( k + 1 - 1 \right)\beta \right]\]
\[ = \frac{\cos\left\{ \alpha + \left( \frac{k - 1}{2} \right)\beta \right\}\sin\left( \frac{k\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)} + \cos\left( \alpha + k\beta \right)\]
\[ = \frac{\cos\left\{ \alpha + \left( \frac{k - 1}{2} \right)\beta \right\}\sin\left( \frac{k\beta}{2} \right) + \sin\left( \frac{\beta}{2} \right)\cos\left( \alpha + k\beta \right)}{\sin\left( \frac{\beta}{2} \right)}\]
\[ = \frac{\sin\left( \alpha + k\beta - \frac{\beta}{2} \right) - \sin\left( \alpha - \frac{\beta}{2} \right) + \sin\left( \alpha + k\beta + \frac{\beta}{2} \right) - \sin\left( \alpha + k\beta - \frac{\beta}{2} \right)}{2\sin\left( \frac{\beta}{2} \right)}\]
\[ = \frac{- \sin\left( \alpha - \frac{\beta}{2} \right) + \sin\left( \alpha + k\beta + \frac{\beta}{2} \right)}{2\sin\left( \frac{\beta}{2} \right)}\]
\[ = \frac{2\cos\left( \frac{2\alpha + k\beta}{2} \right)\sin\left( \frac{k\beta + \beta}{2} \right)}{2\sin\left( \frac{\beta}{2} \right)}\]
\[ = \frac{\cos\left( \alpha + \frac{k\beta}{2} \right)\sin\left( \frac{\left( k + 1 \right)\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)}\]
\[RHS = \frac{\cos\left\{ \alpha + \left( \frac{k + 1 - 1}{2} \right)\beta \right\}\sin\left( \frac{\left( k + 1 \right)\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)}\]
\[ = \frac{\cos\left( \alpha + \frac{k\beta}{2} \right)\sin\left( \frac{\left( k + 1 \right)\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)}\]
\[As, LHS = RHS\]
\[\text{ So, it is also true for n = k + 1 .} \]
\[\text{ Hence,} \cos\alpha + \cos\left( \alpha + \beta \right) + \cos\left( \alpha + 2\beta \right) + . . . + \cos\left[ \alpha + \left( n - 1 \right)\beta \right] = \frac{\cos\left\{ \alpha + \left( \frac{n - 1}{2} \right)\beta \right\}\sin\left( \frac{n\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)} \text{ for all } n \in N .\]
APPEARS IN
RELATED QUESTIONS
Prove the following by using the principle of mathematical induction for all n ∈ N:
`1^3 + 2^3 + 3^3 + ... + n^3 = ((n(n+1))/2)^2`
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:
(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:
`(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:
`1/1.4 + 1/4.7 + 1/7.10 + ... + 1/((3n - 2)(3n + 1)) = n/((3n + 1))`
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 (2n +7) < (n + 3)2
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 + 3 + 32 + ... + 3n−1 = \[\frac{3^n - 1}{2}\]
1 + 3 + 5 + ... + (2n − 1) = n2 i.e., the sum of first n odd natural numbers is n2.
\[\frac{1}{1 . 4} + \frac{1}{4 . 7} + \frac{1}{7 . 10} + . . . + \frac{1}{(3n - 2)(3n + 1)} = \frac{n}{3n + 1}\]
\[\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]
a + ar + ar2 + ... + arn−1 = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]
32n+2 −8n − 9 is divisible by 8 for all n ∈ N.
2.7n + 3.5n − 5 is divisible by 24 for all n ∈ N.
Prove that n3 - 7n + 3 is divisible by 3 for all n \[\in\] N .
7 + 77 + 777 + ... + 777 \[{. . . . . . . . . . .}_{n - \text{ digits } } 7 = \frac{7}{81}( {10}^{n + 1} - 9n - 10)\]
Prove that the number of subsets of a set containing n distinct elements is 2n, for all n \[\in\] N .
\[\text{ The distributive law from algebra states that for all real numbers} c, a_1 \text{ and } a_2 , \text{ we have } c\left( a_1 + a_2 \right) = c a_1 + c a_2 . \]
\[\text{ Use this law and mathematical induction to prove that, for all natural numbers, } n \geq 2, if c, a_1 , a_2 , . . . , a_n \text{ are any real numbers, then } \]
\[c\left( a_1 + a_2 + . . . + a_n \right) = c a_1 + c a_2 + . . . + c a_n\]
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θ)
Answer the following:
Prove, by method of induction, for all n ∈ N
8 + 17 + 26 + … + (9n – 1) = `"n"/2(9"n" + 7)`
Answer the following:
Prove, by method of induction, for all n ∈ N
12 + 42 + 72 + ... + (3n − 2)2 = `"n"/2 (6"n"^2 - 3"n" - 1)`
Answer the following:
Given that tn+1 = 5tn − 8, t1 = 3, prove by method of induction that tn = 5n−1 + 2
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:
22n – 1 is divisible by 3.
Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.
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:
4n – 1 is divisible by 3, for each natural number n.
Prove the statement by using the Principle of Mathematical Induction:
1 + 2 + 22 + ... + 2n = 2n+1 – 1 for all natural numbers n.
If xn – 1 is divisible by x – k, then the least positive integral value of k is ______.
By using principle of mathematical induction for every natural number, (ab)n = ______.
