how to calculate a^(b^c) mod n?

1.3k views Asked by At

Can someone tell me the efficient way to solve this problem ?

abc mod m

a, b, c, and m are 32 bit int

where m is not a prime number and a is not coprime to m?I've looking for the answer, but haven't found it There are some answered questions that familiar with this question, but none of them can explain my problem. Remember if

abc mod m != abc mod m

0

There are 0 answers