Talk:Prime-factor FFT algorithm

From Wikipedia, the free encyclopedia

You have new messages (last change).

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...

[edit] 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.

Retrieved from "http://en.wikipedia.org../../../p/r/i/Talk%7EPrime-factor_FFT_algorithm_0124.html"