Timeline for What is the order of a in (Z/nZ)*?
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 29, 2010 at 8:19 | comment | added | Chris Wuthrich | A good place to start to learn about computational number theory (elementary and more advanced) is Henri Cohen's book "A Course in computational algebraic number theory", Spring GTM 138. Algorithm 1.4.3 in there is what is described in this answer. | |
| Oct 29, 2010 at 6:15 | comment | added | KConrad | Kimball, you can hyperlink in a comment by just cutting and pasting the URL, like en.wikipedia.org/wiki/Emil_Artin | |
| Oct 29, 2010 at 4:55 | comment | added | Kimball | You might also look up primitive roots on wiki (how can I hyperlink in a comment?). To emphasize how little one can say (if I recall correctly), there is no a>1 for which it is even known that a is a primitive root mod p for infinitely many primes p! | |
| Oct 29, 2010 at 2:40 | comment | added | Jeremy West | I feel a bit embarrassed since these are certainly facts that I should have remembered. They key I was missing was the order for prime powers. Thanks for the answer! | |
| Oct 29, 2010 at 2:33 | vote | accept | Jeremy West | ||
| Oct 29, 2010 at 2:17 | history | answered | Felipe Voloch | CC BY-SA 2.5 |