Solution

ID: past-exam-of-the-options-ii-course-of-the-university-of-oxford/2005/c/2/b/i/solution

Fermat's little theorem states that for a prime and an integer not divisible by ,
Equivalently, for every integer , with divisibility by allowed in that latter formulation.

New to topics? Read the docs here!