Polynomial Algorithms and Fast Fourier Transforms

In this chapter, we look at different representations of polynomials and at methods for converting from one representation to another such as the fast Fourier transform (FFT).

A polynomial with integer coefficients is primitive if the greatest common divisor of its coefficients is 1. So 9x2 − 4x + 6 is primitive while 10x2 − 4x + 6 is not.