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 12.129.230.13 (talk) at 14:38, 20 December 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Prime-factor_FFT_algorithm&oldid=32103861"