Abstract Algebra: Theory and Applications · Problem 6.4.5

Introduction to Cryptography — Thomas Judson

Mathematics — Abstract Algebra · fermats-little-theorem

Problem

The number p=137909p = 137909 is prime. Explain how to compute 57137909(mod137909)57^{137909} \pmod{137909} without a calculator.

Related theory

Browse the problem library