Theorem 6.31(Fermat's Little Theorem): if p is prime number, and gcd(a, p=1, then ap-=l mod p o Corollary 6.3: If p is prime number, aEZ, then ap=a mod p Theorem 6.31(Fermat’s Little Theorem): if p is prime number, and GCD(a,p)=1, then ap-11 mod p  Corollary 6.3: If p is prime number, aZ, then apa mod p