Proving De Moivre

1. Proof by Induction DeMoivre’s Theorem
Typically phrased question:
Prove by induction:
Where n is any integer
Step 1: Consider initial value, mostly n=1
……………………………………………………………………………
So the result is true for n=1.
Step 2: Assume the statement is true when n=k, that is if
……………………………………………………………………………
Step 3 Now consider n=k+1………………………………………………….
Here prove right hand side equals left hand or vice versa
So the statement is true when n=k+1.
Therefore since it is true for n=1, by induction it is true for all positive integer
values of n.