Below two propositions are in equivalence relation
For any integer , when is prime number
If integer is not divisible by prime number
Fermat's little theorem
In number theory, Fermat's little theorem states that if p is a prime number, then for any integer a, the number ap − a is an integer multiple of p. In the notation of modular arithmetic, this is expressed as
https://en.wikipedia.org/wiki/Fermat's_little_theorem

Seonglae Cho