please someone that help me whith this problem http://www.spoj.com/problems/POWERUP/ i'm using the fermat little theorem a^p-1=a (mod p). Grace in advance
please someone that help me whith this problem http://www.spoj.com/problems/POWERUP/ i'm using the fermat little theorem a^p-1=a (mod p). Grace in advance
# | 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 | 173 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 160 |
5 | nor | 157 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
Name |
---|
By Fermat theorem a^phi(m) == a (mod m) => a^(phi(m) — 1) == 1 (mod m). In this problem m == 10^9 + 7 is prime, so phi(m) == m — 1.
So A^(B^C) (mod m) == A^(B^C mod (phi(m) — 1)) (mod m) == A^(B^C mod (m — 2)) (mod m).
Yes, I'm applying that theory,but the judge sentence is wrong answer. I would appreciate if you provide me extreme cases in which my code it can fail
You are wrong, aφ(m) = 1.
Savinov thanks, it really aφ (m) = 1.
It's Euler theorem, not Fermat's theorem...
There are some tricky cases when a mod p == 0
``