(1) Use Fermat's Little Theorem and modular exponentiation to find 51^7310 mod 101 (note that 1

Question

(1) Use Fermat&#x27;s Little Theorem and modular exponentiation to find 51^7310 mod  101 (note that 1

Supreeta N · Accepted Answer

Step 1: Fermat&#x27;s Little Theorem states that if p is a prime number and a is an integer not divis

(1) Use Fermat's Little Theorem and modular exponentiation to find \(51^{7310} \text{ mod } 101\) (note that 101 is a prime). (2) Using that 5 is a primitive root modulo 37, find \(log_5^{mod37}(11)\).