Revision as of 17:53, 24 October 2017 edit Stevenj (talk \| contribs) Extended confirmed users 14,849 edits →Finding the generator (g) ← Previous edit		Revision as of 17:54, 24 October 2017 edit undo Stevenj (talk \| contribs) Extended confirmed users 14,849 edits →Finding the generator (g) Next edit →
Line 11: The algorithm explained in the article uses a generator - g - of the modulo N multiplication group, known to exist from number theory. However, no algorithmic way is mentioned to find such a generator. Is there an efficient way to do this? [[Special:Contributions/2A02:8109:9340:112C:FD62:EAA0:5CCE:62F8\|2A02:8109:9340:112C:FD62:EAA0:5CCE:62F8]] ([[User talk:2A02:8109:9340:112C:FD62:EAA0:5CCE:62F8\|talk]]) 01:01, 9 February 2015 (UTC) :Since the generators are extremely common, just exhaustive testing will turn one up pretty quickly, although there are slightly faster algorithms than this.~~<ref>~~ (See e.g. Donald E. Knuth, ''The Art of Computer Programming, vol. 2: Seminumerical Algorithms'', 3rd edition, section 4.5.4, p. 391 (Addison–Wesley, 1998).~~</ref>~~) I'll add a link. == So who is "Rader"? ==

Talk:Rader's FFT algorithm: Difference between revisions