given three numbers p , q, r calculate the pow( p , q!) % r
It would also be helpful if you could mention the important concepts needed in solving this problem ,
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
given three numbers p , q, r calculate the pow( p , q!) % r
It would also be helpful if you could mention the important concepts needed in solving this problem ,
Name |
---|
If $$$p$$$ and $$$r$$$ are relatively prime you use Euler's theorem $$$p^{\phi(r)} = 1$$$ mod $$$r$$$. So you need to calculate $$$q!$$$ mod $$$\phi(r)$$$. $$$\phi$$$ is the Euler totient function, for a prime $$$r$$$ it is just $$$r-1$$$. You can find the answer even if $$$(p, r) > 1$$$, but it involves additional steps.
Thanks a lot, could you also mention what else do I have to learn if (p,r)>1 or will Euler totient function suffice?
In that case you could perform prime decomposition of $$$r$$$. Find the remainder for each prime power and then use the Chinese remainder theorem.
Cant' we directly use the generalization??
from this link