Fast Fourier Transform 2 Useful Properties of Primitive Nth Root of Unity | Part 2
Smart Contract Programmer · 7:03
A primitive \(n\)th root of unity \(w\) satisfies \(w^i = w^{i \bmod n}\) for any integer exponent, and—when \(n\) is even and \(w\) lives in a prime field \(\mathbb{F}q\)—also \(w^{n/2} = -1\), which immediately give...