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

Related Further Mathematics A Level answers

All answers ▸

Prove by mathematical induction that 11^n-6 is divisible by 5 for all natural numbers n


How do I find the asymptotes of a curve?


How do you find the cube root of z = 1 + i?


f(x) = 9x^3 – 33x^2 –55x – 25. Given that x = 5 is a solution of the equation f(x) = 0, use an algebraic method to solve f(x) = 0 completely.