Modulo computing without Euler's theorem

49 Views Asked by At

How would one compute the following congruence without applying Euler's theorem(since it is not possible anyway) and without using calculator?

$2^{1150} \equiv x $ (mod $5^6$)