Jump to content

Talk:Prime-factor FFT algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Johnsoniensis (talk | contribs) at 18:15, 3 May 2024 (math). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

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. Merosonox  t c g  03:20, 19 November 2009 (UTC)[reply]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Prime-factor_FFT_algorithm&oldid=1222070564"