Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Use mathematical induction to show that \({\left( {cosx + isinx} \right)^n} = cosnx + isinnx\)whenever nis a positive integer.

(Here \(i\)is the square root of \( - 1\).) (Hint:Use

the identities \(cos\left( {a + b} \right) = cosa cosb - sina sinb\) and \(sin\left( {a + b} \right) = sina\,cosb + cosa\,sinb\).)

Short Answer

Expert verified

Using mathematical induction, it is proved that \({\left( {\cos x + i\sin x} \right)^n} = \cos nx + i\sin nx\).

Step by step solution

01

Principle of Mathematical Induction

To prove that \(P\left( n \right)\)is true for all positive integers n, where\(P\left( n \right)\)is a propositional function, it completes two steps:

Basis Step:

It verifies that\(P\left( 1 \right)\)is true.

Inductive Step:

It shows that the conditional statement \(P\left( k \right) \to P\left( {k + 1} \right)\)is true for all positive integers k.

02

Proving the basis step

Let\(P\left( n \right)\): “\({\left( {\cos x + i\sin x} \right)^n} = \cos nx + i\sin nx\)”.

In the basis step, it needs to prove that\(P\left( 1 \right)\)is true.

For finding statement\(P\left( 1 \right)\)substituting\(1\)for\(n\)in the statement.

\(\begin{aligned}{l}{\left( {\cos x + i\sin x} \right)^1} &= \cos \left( 1 \right)x + i\sin \left( 1 \right)x\\\cos x + i\sin x &= \cos x + i\sin x\end{aligned}\)

From the above, it can see that the statement \(P\left( 1 \right)\) is true this is also known as the basis step of the proof.

03

Proving the Inductive step

In the inductive step, it needs to prove that, if\(P\left( k \right)\)is true, then\(P\left( {k + 1} \right)\)is also true.

That is,\(P\left( k \right) \to P\left( {k + 1} \right)\)is true for all positive integers k.

In the inductive hypothesis, it assumes that\(P\left( k \right)\)is true for any arbitrary positive integer\(k\).

That is, it is written as:

\({\left( {\cos x + i\sin x} \right)^k} = \cos kx + i\sin kx\)

Now it must have to show that\(P\left( {k + 1} \right)\)is also true.

\({\left( {\cos x + i\sin x} \right)^{k + 1}} = {\left( {\cos x + i\sin x} \right)^k}\left( {\cos x + i\sin x} \right)\)

From the inductive hypothesis, it knows\({\left( {\cos x + i\sin x} \right)^k} = \cos kx + i\sin kx\).

Therefore, it is written as:

\(\begin{aligned}{c}{\left( {\cos x + i\sin x} \right)^{k + 1}} &= \left( {\cos kx + i\sin kx} \right)\left( {\cos x + i\sin x} \right)\\ &= \cos kx\,\,\cos x + i\sin kx\,\,\cos x + i\cos kx\,\,\sin x - \sin kx\,\,\sin x\\ &= \cos kx\,\cos x - \sin kx\sin x + i\left( {\sin kx\,\cos x + \cos kx\,\sin x} \right)\end{aligned}\)

Now applying the formula:

\(\cos \left( {a + b} \right) = \cos a\cos b - \sin a\sin b\)

\(\sin \left( {a + b} \right) = \sin a\cos b + \cos a\sin b\)

From the above, it can see that\(P\left( {k + 1} \right)\)is also true.

Hence,\(P\left( {k + 1} \right)\)is true under the assumption that\(P\left( k \right)\)is true. This completes the inductive step.

Hence using mathematical induction, it is proved that \({\left( {\cos x + i\sin x} \right)^n} = \cos nx + i\sin nx\).

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Trace Algorithm 1 when it is given n = 5 as input. That is, show all steps used by Algorithm 1 to find 5!, as is done in Example 1 to find 4!.

In the proof of Lemma 1 we mentioned that many incorrect methods for finding a vertex such that the line segment is an interior diagonal of have been published. This exercise presents some of the incorrect ways has been chosen in these proofs. Show, by considering one of the polygons drawn here, that for each of these choices of , the line segment is not necessarily an interior diagonal of .

a) p is the vertex of P such that the angleabpis smallest.

b) p is the vertex of P with the least -coordinate (other than ).

c) p is the vertex of P that is closest to .

The well-ordering property can be used to show that there is a unique greatest common divisor of two positive integers. Let a and be positive integers, and let S be the set of positive integers of the form as+bt, where s and t are integers.

a) Show that s is nonempty.

b) Use the well-ordering property to show that s has a smallest element .

c) Show that if d is a common divisor of a and b, then d is a divisor of c.

d) Show that c I a and c I b. [Hint: First, assume that cXa. Then a=qc+r, where 0<r<c. Show that rS, contradicting the choice of c.]

e) Conclude from (c) and (d) that the greatest common divisor of a and b exists. Finish the proof by showing that this greatest common divisor is unique.

Suppose that a and b are real numbers with 0 < b < a . Prove that if n is a positive integer, then anbnnan1(ab)

Prove that the algorithm you devised in Exercise 17 is correct.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free