Euler's Theorem

Published On :2021-02-22 01:35:00

 Def :

If n belongs natural numbers , a belongs integers such that

 GCD(a , n) = 1 . Then

a^Q(n) = 1 (mod n )

**Q(n) is Euler's Phi-Function**

Recall :

Fermat's little theorem :

Let p be prime , a belongs to integers , and p doesn't divide a . Then

a^p-1 = 1 (mod p)