The problem involves working with powers of the imaginary unit \(i = \sqrt{-1}\). The key property of powers of \(i\) is their cyclical pattern:
This pattern repeats every four exponents. Therefore, depending on \(n \mod 4\), we can express any power of \(i\) as:
We are tasked with finding the sum \(i^n + i^{n+1} + i^{n+2} + i^{n+3}\). Regardless of \(n \mod 4\), observe that each sequence covers a complete cycle of four consecutive terms:
In each case, adding the four numbers results in zero:
Thus, the expression \(i^n + i^{n+1} + i^{n+2} + i^{n+3}\) simplifies to \(0\) for any positive integer \(n\).
If \( z \) is a complex number and \( k \in \mathbb{R} \), such that \( |z| = 1 \), \[ \frac{2 + k^2 z}{k + \overline{z}} = kz, \] then the maximum distance from \( k + i k^2 \) to the circle \( |z - (1 + 2i)| = 1 \) is: