Could anyone explain to me the proof for such a method of checking whether a number is primitive root or not http://zobayer.blogspot.com/2010/02/primitive-root.html
why should i check only certain numbers to be equal to one or not ?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Could anyone explain to me the proof for such a method of checking whether a number is primitive root or not http://zobayer.blogspot.com/2010/02/primitive-root.html
why should i check only certain numbers to be equal to one or not ?
Name |
---|
Since n is a prime, we know that gφ(n) = gn - 1 = 1. We want to know if there is another exponent e < n - 1 such that ge = 1.
Let e be the smallest, positive integer with ge = 1. This means that the exponents that give 1 are exactly 0, e, 2e, 3e, .... This means that e divides n - 1. If e is really smaller than n - 1, then there must exist a prime factor p of n - 1, such that e still divides . Which means that .
So it is sufficient to check if any of the terms , with p prime and p | n - 1, is equal to 1.