We know that if n is prime, then:
{a^(n-1)} mod n = 1 [Fermat primality test]
Can anyone explain its mathematical proof?
# | User | Rating |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
3 | awoo | 161 |
4 | nor | 152 |
4 | maroonrk | 152 |
6 | -is-this-fft- | 151 |
7 | TheScrasse | 149 |
8 | Petr | 145 |
8 | atcoder_official | 145 |
10 | pajenegod | 144 |
We know that if n is prime, then:
{a^(n-1)} mod n = 1 [Fermat primality test]
Can anyone explain its mathematical proof?
Name |
---|
https://en.wikipedia.org/wiki/Proofs_of_Fermat%27s_little_theorem
Auto comment: topic has been updated by MRITuhin (previous revision, new revision, compare).