English

Prove by method of induction, for all n ∈ N: (cos θ + i sin θ)n = cos (nθ) + i sin (nθ) - Mathematics and Statistics

Advertisements
Advertisements

Question

Prove by method of induction, for all n ∈ N:

(cos θ + i sin θ)n = cos (nθ) + i sin (nθ)

Sum
Advertisements

Solution

Let P(n) ≡ (cos θ + i sin θ)n = cos nθ + i sin nθ, for all n  ∈ N.

Step 1:

For n = 1, L.H.S. = cos θ + i sin θ

R.H.S. = cos θ + i sin θ

∴ L.H.S. = R.H.S. 

∴ P(1) is true.

Step 2:

Let us assume that for some k ∈ N, P(k) is true,

i.e., (cos θ + i sin θ)k = cos kθ + i sin kθ    ...(1)

Step 3: To prove that P(k + 1) is true,

i.e., to prove that

(cos θ + i sin θ)k+1 = cos (k + 1)(θ + i sin (k + 1) θ

L.H.S. = (cos θ + i sin θ)k+1

= (cos θ + i sin θ)k · (cos θ + i sin θ)

= (cos kθ + i sin kθ) · (cos θ + i sin θ)    ...[By (1)]

= cos kθ · cos θ + i cos kθ sin θ + i sin kθ cos θ + i2 sin kθ sin θ

= (cos kθ cos θ – sin kθ sin θ) + i(sin kθ cos θ + cos kθ sin θ)  ......[as i2 = – 1]

= cos(kθ + 0) + i sin (kθ + θ)

= cos (k + 1)θ + i sin(k + 1)θ

= R.H.S.

∴ P(k + 1) is true.

Step 4:

From all the above steps and by the principle of mathematical induction, P(n) is true for all n ∈ N,

i.e., (cos θ + i sin θ)n = cos nθ + i sin nθ. for all n ∈ N

shaalaa.com
  Is there an error in this question or solution?
Chapter 4: Methods of Induction and Binomial Theorem - Exercise 4.1 [Page 74]

APPEARS IN

Balbharati Mathematics and Statistics 2 (Arts and Science) [English] Standard 11 Maharashtra State Board
Chapter 4 Methods of Induction and Binomial Theorem
Exercise 4.1 | Q 14 | Page 74

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 + 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

`a + ar + ar^2 + ... + ar^(n -1) = (a(r^n - 1))/(r -1)`

Prove the following by using the principle of mathematical induction for all n ∈ Nn (n + 1) (n + 5) is a multiple of 3.


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)?


1 + 3 + 32 + ... + 3n−1 = \[\frac{3^n - 1}{2}\]

 

1.3 + 2.4 + 3.5 + ... + n. (n + 2) = \[\frac{1}{6}n(n + 1)(2n + 7)\]

 

a + ar + ar2 + ... + arn−1 =  \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]

 

52n −1 is divisible by 24 for all n ∈ N.


52n+2 −24n −25 is divisible by 576 for all n ∈ N.

 

72n + 23n−3. 3n−1 is divisible by 25 for all n ∈ N.

 

\[\frac{n^7}{7} + \frac{n^5}{5} + \frac{n^3}{3} + \frac{n^2}{2} - \frac{37}{210}n\] is a positive integer for all n ∈ N.  

 


x2n−1 + y2n−1 is divisible by x + y for all n ∈ N.

 

Prove by method of induction, for all n ∈ N:

2 + 4 + 6 + ..... + 2n = n (n+1)


Prove by method of induction, for all n ∈ N:

12 + 22 + 32 + .... + n2 = `("n"("n" + 1)(2"n" + 1))/6`


Prove by method of induction, for all n ∈ N:

12 + 32 + 52 + .... + (2n − 1)2 = `"n"/3 (2"n" − 1)(2"n" + 1)`


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)`


Prove by method of induction, for all n ∈ N:

`1/(1.3) + 1/(3.5) + 1/(5.7) + ... + 1/((2"n" - 1)(2"n" + 1)) = "n"/(2"n" + 1)`


Prove by method of induction, for all n ∈ N:

(23n − 1) is divisible by 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:

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, 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 loga xn = n logax, x > 0, n ∈ N


Answer the following:

Prove by method of induction 152n–1 + 1 is divisible by 16, for all n ∈ N.


Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:

1 + 3 + 5 + ... + (2n – 1) = n2 


Prove by induction that for all natural number n sinα + sin(α + β) + sin(α + 2β)+ ... + sin(α + (n – 1)β) = `(sin (alpha + (n - 1)/2 beta)sin((nbeta)/2))/(sin(beta/2))`


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:

n2 < 2n for all natural numbers n ≥ 5.


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.


Prove that `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.


If 10n + 3.4n+2 + k is divisible by 9 for all n ∈ N, then the least positive integral value of k is ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×