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 + 3^2 + ... + 3^(n – 1) =((3^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 + 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+ 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+2+ 3+...+n<1/8(2n +1)^2`
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.
12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .
\[\frac{1}{1 . 2} + \frac{1}{2 . 3} + \frac{1}{3 . 4} + . . . + \frac{1}{n(n + 1)} = \frac{n}{n + 1}\]
1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]
\[\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]
12 + 32 + 52 + ... + (2n − 1)2 = \[\frac{1}{3}n(4 n^2 - 1)\]
a + ar + ar2 + ... + arn−1 = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]
n(n + 1) (n + 5) is a multiple of 3 for all n ∈ N.
11n+2 + 122n+1 is divisible by 133 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}\]
\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\] for all n ∈ 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:
(24n−1) is divisible by 15
Prove by method of induction, for all n ∈ N:
3n − 2n − 1 is divisible by 4
Prove by method of induction, for all n ∈ N:
5 + 52 + 53 + .... + 5n = `5/4(5^"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 152n–1 + 1 is divisible by 16, for all n ∈ 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 ______.
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 ______.
State whether the following proof (by mathematical induction) is true or false for the statement.
P(n): 12 + 22 + ... + n2 = `(n(n + 1) (2n + 1))/6`
Proof By the Principle of Mathematical induction, P(n) is true for n = 1,
12 = 1 = `(1(1 + 1)(2*1 + 1))/6`. Again for some k ≥ 1, k2 = `(k(k + 1)(2k + 1))/6`. Now we prove that
(k + 1)2 = `((k + 1)((k + 1) + 1)(2(k + 1) + 1))/6`
Prove the statement by using the Principle of Mathematical Induction:
23n – 1 is divisible by 7, 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:
n3 – n is divisible by 6, for each natural number n ≥ 2.
Prove the statement by using the Principle of Mathematical Induction:
2n < (n + 2)! for all natural number n.
Prove the statement by using the Principle of Mathematical Induction:
1 + 5 + 9 + ... + (4n – 3) = n(2n – 1) for all natural numbers n.
