Using Fermat's Little Theorem find the value for x.
x ≡ 9^(794) mod 73
I don't even know where to begin, I need step by step help majorly : )
means that is a multiple of n.
In some cases, b represents the remainder of a in the Euclidian division by n.
a and b can be negative or positive.
Basic operations :
Also, , for any k in
<< for this one, always look for congruences to 1, because any power of 1 always yields 1.
Be careful :
There are several properties you should know...
Fermat's little theorem states :
(with a, not multiple of p)