bio | website | |
---|---|---|
location | ||
age | ||
visits | member for | 2 years, 7 months |
seen | May 31 '13 at 19:04 | |
stats | profile views | 18 |
May 9 |
awarded | Popular Question |
Dec 7 |
revised |
Primitive $k$th root of unity in a finite field $\mathbb{F}_p$
formatting |
Dec 7 |
awarded | Student |
Dec 6 |
awarded | Editor |
Dec 6 |
revised |
Primitive $k$th root of unity in a finite field $\mathbb{F}_p$
improved formatting |
Dec 6 |
awarded | Scholar |
Dec 6 |
accepted | Primitive $k$th root of unity in a finite field $\mathbb{F}_p$ |
Dec 5 |
comment |
Primitive $k$th root of unity in a finite field $\mathbb{F}_p$
Clarification: sorry my notation isn't perfect. I meant the finite field F_p i.e., a set of integers between {0, 1, ... p-1} where p is a prime. Basically, I am doing FFT over a finite field with k elements. Doing so requires me to first find a primitive kth root of unity in F_p, right? so, my question is how do I do it. Most descriptions of FFT assume that the primitive root is known. |
Dec 5 |
asked | Primitive $k$th root of unity in a finite field $\mathbb{F}_p$ |