Below two propositions are in equivalence relationFor any integer , when is prime numberIf integer is not divisible by prime number Fermat's little theoremIn 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 ashttps://en.wikipedia.org/wiki/Fermat's_little_theorem