Polynomial Algebra: an Application of the Fast Fourier Transform

MUCH use is made in combinatorial problems of generating functions in the form of polynomials and infinite power series, these being obtained by the manipulation of other algebraic expressions. In order to save time and improve accuracy in the evaluation of the coefficients, one can, of course, make use of computer programs for doing algebra1,2. But it is often easier to use the following method which relies only on arithmetical operations available in all programming languages.