Answers are grounded in this paper and cite their sources.
A generalization of the Fermat and Mersenne number transform is suggested. The transforms are defined over finite fields and rings. This paper establishes the conditions necessary for these numbers to be prime. The length of the transforms is a highly composite number. An algorithm for finding primitive roots of unity is also discussed. The proposed transforms are characterized by respectable combinations of transform length, dynamic range and computational efficiency and can be used for fast convolution of integer sequences.>
No takes yet. Share an insight, caveat, or question.
Dimitrov et al. (1994) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: