For any integer a and a prime number p, this demonstrates Fermats Little Theorem.

This calculator has 2 inputs.

This calculator has 2 inputs.

- fermats little theorem
- integer
- a whole number; a number that is not a fraction

...,-5,-4,-3,-2,-1,0,1,2,3,4,5,... - modulus
- the remainder of a division, after one number is divided by another.

a mod b - multiple
- the product of any quantity and an integer
- prime number
- a natural number greater than 1 that is not a product of two smaller natural numbers.
- theorem
- A statement provable using logic