Talk:Prime-factor FFT algorithm

[Untitled]
can we use the expression (2^n - 2)mod n, for extracting prime numbers, what are probable issues when this type of expression is used? thank you for your time...

Link to FFTW
As far as i have understood the majority of the serious programs for numerical analysis uses a library named FFTW. I would wikipedia to mention which FFT algorithm is used in FFTW.


 * Rader's FFT algorithm in the references. Mero son ox   t c g  03:20, 19 November 2009 (UTC)