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:
Prove the following by using the principle of mathematical induction for all n ∈ N: 1.2 + 2.22 + 3.22 + … + n.2n = (n – 1) 2n+1 + 2
Prove the following by using the principle of mathematical induction for all n ∈ N: 102n – 1 + 1 is divisible by 11
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.
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.
1 + 3 + 32 + ... + 3n−1 = \[\frac{3^n - 1}{2}\]
\[\frac{1}{3 . 5} + \frac{1}{5 . 7} + \frac{1}{7 . 9} + . . . + \frac{1}{(2n + 1)(2n + 3)} = \frac{n}{3(2n + 3)}\]
\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 5} + . . . + \frac{1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\]
52n+2 −24n −25 is divisible by 576 for all n ∈ N.
32n+2 −8n − 9 is divisible by 8 for all n ∈ N.
Given \[a_1 = \frac{1}{2}\left( a_0 + \frac{A}{a_0} \right), a_2 = \frac{1}{2}\left( a_1 + \frac{A}{a_1} \right) \text{ and } a_{n + 1} = \frac{1}{2}\left( a_n + \frac{A}{a_n} \right)\] for n ≥ 2, where a > 0, A > 0.
Prove that \[\frac{a_n - \sqrt{A}}{a_n + \sqrt{A}} = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right) 2^{n - 1}\]
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?
x2n−1 + y2n−1 is divisible by x + y for all n ∈ N.
\[\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:
1.2 + 2.3 + 3.4 + ..... + n(n + 1) = `"n"/3 ("n" + 1)("n" + 2)`
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)`
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:
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))`
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
1 + 3 + 5 + ... + (2n – 1) = n2
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
22n – 1 is divisible by 3.
Prove by the Principle of Mathematical Induction that 1 × 1! + 2 × 2! + 3 × 3! + ... + n × n! = (n + 1)! – 1 for all natural numbers n.
Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.
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
Give an example of a statement P(n) which is true for all n. Justify your answer.
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:
2 + 4 + 6 + ... + 2n = n2 + n for all natural numbers n.
A sequence b0, b1, b2 ... is defined by letting b0 = 5 and bk = 4 + bk – 1 for all natural numbers k. Show that bn = 5 + 4n for all natural number n using mathematical induction.
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 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.
Show that `n^5/5 + n^3/3 + (7n)/15` is a natural number for all n ∈ N.
By using principle of mathematical induction for every natural number, (ab)n = ______.
