Advertisements
Advertisements
प्रश्न
Advertisements
उत्तर
\[\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
संबंधित प्रश्न
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:
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: 41n – 14n is a multiple of 27.
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.
Given an example of a statement P (n) such that it is true for all n ∈ N.
If P (n) is the statement "n2 − n + 41 is prime", prove that P (1), P (2) and P (3) are true. Prove also that P (41) is not true.
\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]
\[\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)}\]
\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 5} + . . . + \frac{1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\]
2 + 5 + 8 + 11 + ... + (3n − 1) = \[\frac{1}{2}n(3n + 1)\]
1.3 + 2.4 + 3.5 + ... + n. (n + 2) = \[\frac{1}{6}n(n + 1)(2n + 7)\]
1.2 + 2.3 + 3.4 + ... + n (n + 1) = \[\frac{n(n + 1)(n + 2)}{3}\]
\[\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]
a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]
32n+2 −8n − 9 is divisible by 8 for all n ∈ N.
(ab)n = anbn for all n ∈ N.
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{ 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) \text{ for } n \geq 2, \text{ where } a > 0, A > 0 . \]
\[\text{ 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} .\]
\[\text{ A sequence } x_0 , x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_0 = 5 and x_k = 4 + x_{k - 1}\text{ for all natural number k . } \]
\[\text{ Show that } x_n = 5 + 4n \text{ for all n } \in N \text{ using mathematical induction .} \]
\[\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:
5 + 52 + 53 + .... + 5n = `5/4(5^"n" - 1)`
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.
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"):}`
Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.
Prove the statement by using the Principle of Mathematical Induction:
For any natural number n, 7n – 2n is divisible by 5.
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 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 ≥ ______.
By using principle of mathematical induction for every natural number, (ab)n = ______.
