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 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 145 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 132 |
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) \gt 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