Abstract Algebra: Theory and Applications · Problem 6.5.7

Introduction to Cryptography — Thomas Judson

Mathematics — Abstract Algebra · eulers-theorem

Problem

Verify Euler's Theorem for

n = 15

and

a = 4

. Hint.

4^{\phi(15)} \equiv 4^8 \equiv 1 \pmod{15}