Editing Discrete Fourier transform (section)

====Multiplication of large integers====

The fastest known [[multiplication algorithms|algorithms]] for the multiplication of very large [[integer]]s use the polynomial multiplication method outlined above.  Integers can be treated as the value of a polynomial evaluated specifically at the number base, with the coefficients of the polynomial corresponding to the digits in that base (ex. <math>123 = 1 \cdot 10^2 + 2 \cdot 10^1 + 3 \cdot 10^0</math>).  After polynomial multiplication, a relatively low-complexity carry-propagation step completes the multiplication.