structural:scholar_edition, structural:summarization, stylistic:style_transfer
Fast Fourier transform

The prime-factor FFT algorithm (also called Good-Thomas algorithm) uses the Chinese remainder theorem for reducing the computation of a fast Fourier transform of size n 1 n 2 {\displaystyle n_{1}n_{2}} to the computation of two fast Fourier transforms of smaller sizes n 1 {\displaystyle n_{1}} and n 2 {\displaystyle n_{2}} (providing that n 1 {\displaystyle n_{1}} and n 2 {\displaystyle n_{2}} are coprime).