Soon we will get Codeforces 4-digit contest 1000, as the educational round 45.
http://codeforces.com/contests/1000
Isn't it amazing. <3
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 172 |
2 | adamant | 164 |
3 | awoo | 163 |
4 | TheScrasse | 160 |
5 | nor | 157 |
6 | maroonrk | 155 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 145 |
9 | pajenegod | 145 |
Soon we will get Codeforces 4-digit contest 1000, as the educational round 45.
http://codeforces.com/contests/1000
Isn't it amazing. <3
We know that if n is prime, then:
{a^(n-1)} mod n = 1 [Fermat primality test]
Can anyone explain its mathematical proof?
Name |
---|