I have found that the answer to my question is
a^((b^c) % prime — 1) % prime
But I don't know a proof, can anyone tell me the proof or give me a tutorial to read it. Thanks
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
I have found that the answer to my question is
a^((b^c) % prime — 1) % prime
But I don't know a proof, can anyone tell me the proof or give me a tutorial to read it. Thanks
Name |
---|
Fermat's little theorem states that for a prime $$$p$$$ and any integer $$$a$$$ such that $$$0 < a < p$$$,
In other words, the powers of $$$a$$$ modulo $$$p$$$ repeat with a period of $$$p-1$$$.
This is further generalized by Euler's theorem which implies the powers of $$$a$$$ repeat with a period of $$$p-1$$$. This can be even further generalized with Lagrange's theorem for groups.
https://www.geeksforgeeks.org/find-abm-where-b-is-very-large/
You can use above link for better understanding.