How to solve this very big number using either fermet or eulers theorem

35 Views Asked by At

How do i approach this. Am used to only when the mode is prime.

I took euclidean for 5 and 396 and got 396 = 79*5 + 1. But i dont know how to proceed from here

$5^{2159} mod(396)$

1

There are 1 best solutions below

0
On

You might want to look into Modular Exponentiation Algorithm, it should tell you how to easily solve these problems.