Prove De Moivre's by induction for the positive integers

First we check the formula for our first case, n=1 where (cosx + isinx)n =cosnx + isinnx (cosx + isinx)1 = cos(1x) + isin(1x) - holds true for n=1 next we assume true for our case n=k(cosx + isinx)k = coskx + isinkxnext we show that if the case for n=k is true, then the case n=k+1 is true.by inputting n=k+1 we get (cosx+isinx)(k+1)=(cosx+isinx)(cosx+isinx)know as we assumed for n=k ,this equals (cosx+isinx)(coskx+isinkx)this gives cosxcoskx +icosxsinkx +isinxcoskx -sinxsinkxsimplifying to (coskxcosx -sinxsinkx) + i(cosxsinkx + sinxcoskx)finally through the compound angle formulae we reach our desired result: (cosx+isinx)k+1 = cos((k+1)x) + isin((k+1)x) conclusion: If n=k holds true, then n=k+1 holds true. Since n=1 holds true we have now shown that De Moivre's theorem holds true for all positive integers.

HS
Answered by Harry S. Further Mathematics tutor

3210 Views

See similar Further Mathematics A Level tutors

Related Further Mathematics A Level answers

All answers ▸

How do I find the square root of a complex number?


How do I find the inverse of a 3x3 matrix?


Given that abc = -37 + 36i; b = -2 + 3i; c = 1 + 2i, what is a?


The plane Π contains the points (1, 2, 3), (0, 1, 2) and (2, 3, 0). What is the vector equation of the plane? and what is the cartesian equation of the plane?


We're here to help

contact us iconContact ustelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

© MyTutorWeb Ltd 2013–2025

Terms & Conditions|Privacy Policy
Cookie Preferences