Chapter 4: Q35E (page 285)
Use Fermat’s little theorem to show that if is prime and , then role="math" localid="1668657209564" is an inverse of a modulo
Short Answer
Using the Fermat’s little theorem,
is an inverse of modulo