❦

Fermat’s Little Theorem

A small theorem from the age of ink, correspondence, and candlelit mathematics —
yet powerful enough to shape modern number theory, cryptography, and modular arithmetic.

A Small Theorem With Enormous Consequences

Fermat’s Little Theorem reveals that prime numbers create hidden cycles inside arithmetic.
Large powers do not simply grow without limit. When measured modulo a prime, they fold back
into orderly patterns of residues.

What first appears to be a shortcut for reducing large powers becomes a doorway into finite
fields, cyclic groups, primality testing, cryptography, elliptic curves, and Diophantine equations.

Power expands. The prime modulus folds it back.

The Prime Clock

Modular arithmetic is often described as clock arithmetic. On a clock, numbers wrap around.
After 12 comes 1 again. In modular arithmetic, after the modulus is reached, counting returns
to zero.

Modulo 7, for example, the residues are:

0 → 1 → 2 → 3 → 4 → 5 → 6 → 0

When the modulus is prime, the nonzero residues form a clean multiplicative system:

1, 2, 3, …, p−1

Every nonzero residue has an inverse. Multiplication does not destroy the system;
it rearranges it. That rearrangement is the hidden symmetry behind Fermat’s theorem.

Worked Example

Suppose we want to reduce:

5¹¹⁹ mod 59

Since 59 is prime, Fermat tells us:

5⁵⁸ ≡ 1 mod 59

Now break the exponent apart:

119 = 58 + 58 + 3

Therefore:

5¹¹⁹ ≡ 5³ ≡ 125 ≡ 7 mod 59

Why the Theorem Works

Take the nonzero residues modulo a prime:

1, 2, 3, …, p−1

Now multiply each one by a number a that is not divisible by p:

a, 2a, 3a, …, (p−1)a

Because p is prime, this new list is simply a rearrangement of the original residues.
The same numbers appear again, only in a different order.

Since the products are equal modulo p, we get:

a^p−1(p−1)! ≡ (p−1)! mod p

After cancelling the common factor, the theorem appears:

a^p−1 ≡ 1 mod p

Fermat Curves and Deeper Geometry

Fermat’s name also belongs to equations of the form:

xⁿ + yⁿ = zⁿ

These are Diophantine equations, meaning they ask for integer or rational solutions.
Fermat’s Last Theorem states that no positive integer solutions exist when n is greater than 2.

Related curves, such as:

xⁿ + yⁿ = 1

became important objects in algebraic geometry. These Fermat curves connect arithmetic,
symmetry, rational points, modular forms, and elliptic curves.

The Cryptographic Echo

Fermat’s Little Theorem lives inside modern computation. It helps make modular exponentiation
practical, which is essential for primality testing and public-key cryptography.

Whenever digital systems use large primes, modular powers, encrypted communication, or secure
signatures, they are operating in the mathematical world Fermat helped reveal.

Beware the Tricksters

Some composite numbers imitate prime behavior. These are called pseudoprimes.
Carmichael numbers are even more deceptive because they can satisfy Fermat-like tests
for many bases.

341 = 11 × 31
561 = 3 × 11 × 17

Their existence teaches an important lesson: surface patterns can imitate truth.
Deeper structure must be tested.

Key Takeaways

• Prime moduli create clean arithmetic cycles.
• Large powers can collapse into small residues.
• The theorem arises from permutation symmetry.
• Fermat curves connect arithmetic to geometry.
• Elliptic curves extend Fermat’s legacy into modern mathematics.
• Cryptography depends heavily on modular exponentiation.
• Pseudoprimes show why deeper tests are necessary.

Small theorem. Vast consequence. A prime modulus turns arithmetic into a chamber of return.

ModularMath.org · Fermat, prime cycles, residues, curves, and modular return