Prove by induction that if $i^2 = -1 $, then for every integer $n >= 1$, $[\cos(x) + i\sin(x)]^n = \cos(nx) + i\sin(nx)$.
My solution so far: 1. It can be easily shown that it is true for n = 1. 2. Then it has to be proven that if $$[\cos(x) + i\sin(x)]^n = \cos(nx) + i\sin(nx)$$ it follows that $$[\cos(x) + i\sin(x)]^{n+1} = \cos[(n+1)x] + i\sin[(n+1)x]$$ $$[\cos(x) + i\sin(x)]^n [\cos(x) + i\sin(x)] = \cos[(n+1)x] + i\sin[(n+1)x]$$ Using the induction hypothesis to substitute $[\cos(x) + i\sin(x)]^n$ we get $$[\cos(nx) + i\sin(nx)][\cos(x) + i\sin(x)] = \cos[(n+1)x] + i\sin[(n+1)x]$$ This can be rewritten as $$\cos(x)\cos(nx)+i\sin(x)\cos(nx) +i\sin(nx)\cos(x)-\sin(x)\sin(nx) = \cos[(n+1)x] + i\sin[(n+1)x]$$ I am not sure how to proceed at this point, any help is appreciated.