Here is a general method without using Euler's formula, and formulas for this expansion for any $k$ exponent.
Since we can view multiplication of $i$ as a rotation by 90 degrees, which is
periodic with return to the point of origin after $4$ rotations, we see that $i$ is an element of order 4 (if you've seen a little algebra).
This gives us:
$i^{n}=i$ whenever $n\cong 1 (\mod 4)$
$i^{n}=-1$ whenever $n\cong 2 (\mod 4)$
$i^{n}=-i$ whenever $n\cong 3 (\mod 4)$
$i^{n}=1$ whenever $n\cong 0 (\mod 4)$
Breaking up by these cases, and searching for a pattern from a
few computations you can conjecture
the following formulas:
If $k\cong 1 (\mod 4)$, we have:
\begin{equation*}
(1+i)^{k}=(-4)^{\lfloor{k/4}\rfloor}(1+i)
\end{equation*}
if $k\cong 2 (\mod 4)$, we have:
\begin{equation*}
(1+i)^{k}=(-4)^{\lfloor{k/4}\rfloor}2i
\end{equation*}
if $k\cong 3 (\mod 4)$, we have:
\begin{equation*}
(1+i)^k=(-4)^{\lfloor{k/4}\rfloor}(2i-2)
\end{equation*}
if $k\cong 0 (\mod 4)$, we have:
\begin{equation*}
(1+i)^k=(-4)^{k/4}
\end{equation*}
All of which can be proved by induction without too much trouble.
$a^bcde$$a^bcde$ to$a^{bcde}$$a^{bcde}$ – JMoravitz Jul 03 '16 at 04:30