Timeline for Primitive $k$th root of unity in a finite field $\mathbb{F}_p$
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 7, 2012 at 17:59 | history | edited | codegeek234 | CC BY-SA 3.0 |
formatting
|
| Dec 6, 2012 at 23:38 | history | edited | codegeek234 | CC BY-SA 3.0 |
improved formatting; Post Made Community Wiki
|
| Dec 6, 2012 at 0:03 | vote | accept | codegeek234 | ||
| Dec 5, 2012 at 23:52 | answer | added | ACL | timeline score: 8 | |
| Dec 5, 2012 at 23:40 | comment | added | codegeek234 | 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, 2012 at 23:32 | comment | added | David Roberts♦ | And when you say "the" $k^{th}$ root of unity, you know there are $k$ of them, and they are not all equal in status? | |
| Dec 5, 2012 at 23:31 | comment | added | David Roberts♦ | Umm, $\mathbb{Z}/p$ is not algebraically closed ... | |
| Dec 5, 2012 at 23:28 | history | asked | codegeek234 | CC BY-SA 3.0 |