Fermat's Little Theorem

Fermat's Theorem:

Fermat's little theorem states that if p is a prime number, then for any integer a, the a^(p-1) (mod p)=1.

Let's check that, by setting modu below to a prime number and m to modu-1. For example, we can set modu to 5, 7, 11, and 13, and m to 4, 6, 10, and 12. Then, we will observe that the output will be 1 (represented as an arrow pointing to 1)

Next: In this section, we learned about Fermat's Little Theore, that is a special case of Euler's Theorem, which we will learn in the next section.

Reference: Wikipedia