KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesThe Fermat Test and Carmichael NumbersEngineering · Engineering MathematicsLesson 614/883← PrevNext →
GuidePublished 7 Aug 2026Updated 13 Aug 20268 min readBy Kevin Jogin
On this page

Ask about this page

KEVOS AIThe Fermat Test and Carmichael Numbers

KEVOS knowledge first · trusted web sources when needed

Engineering  /  Mathematics  — Primality Testing

The Fermat Test and Carmichael Numbers

The Fermat primality test, pseudoprimes, and the Carmichael numbers that defeat it for every base.

Page KV-MATH-0387Reading time 3 minReviewed 2026-08-07Author Kevin Jogin

Executive summary

The Fermat test checks whether a candidate satisfies Fermat's little theorem for a chosen base. Failure proves compositeness; success proves nothing.

Carmichael numbers pass for every base coprime to them, so no amount of repetition rescues the test. They are the reason Miller-Rabin exists.

Learning objectives

  1. State the Fermat test and its one-sided guarantee.
  2. Define pseudoprimes and Carmichael numbers.
  3. Explain why Carmichael numbers make the test unrepairable.

01The test

Algorithm

Fermat primality test

Inputcandidate n, base a
Outputcomposite (certain), or probably prime
  1. Choose a base a with 1 < a < n.
  2. If gcd(a, n) ≠ 1, report composite with factor gcd(a, n).
  3. Compute r = a^{n−1} mod n by repeated squaring.
  4. If r ≠ 1, report composite.
  5. Otherwise report probably prime.
Cost  one modular exponentiation, O(len(n)³)

The guarantee is one-sided. A verdict of composite is certain, since a prime would necessarily satisfy the congruence. A verdict of probably prime carries no certainty at all.

02Pseudoprimes and Carmichael numbers

Definition

Fermat pseudoprime and Carmichael number

A composite n is a Fermat pseudoprime to base a if a^{n−1} ≡ 1 (mod n).

A composite n is a Carmichael number if it is a pseudoprime to every base coprime to n.

Caution
Carmichael numbers cannot be detected by the Fermat test at any number of rounds. The smallest is 561 = 3 · 11 · 17, and there are infinitely many, so this is not a finite list of exceptions that could be tabulated away.
Theorem

Korselt's criterion

A composite n is a Carmichael number if and only if n is squarefree and (p − 1) | (n − 1) for every prime p dividing n.

The criterion explains the mechanism. Squarefreeness plus the divisibility condition makes λ(n) divide n − 1, so every unit raised to n − 1 gives 1 — exactly the Fermat condition, satisfied for structural reasons rather than by accident.

03Why Miller-Rabin succeeds

The Fermat test examines only the order of the group. Miller–Rabin examines the sequence of squarings leading to the final value, and looks for a square root of 1 other than ±1.

  1. Write n − 1 = 2^s · d with d odd

    Separates the odd part from the powers of two.

  2. Compute a^d, then square repeatedly

    This traces the path to a^{n−1} through s squarings.

  3. Watch for a non-trivial square root of 1

    If some value squares to 1 without being ±1, n is composite.

  4. Conclude

    A prime modulus admits only ±1 as square roots of 1, so this cannot happen.

Note
Carmichael numbers do not escape this. Being composite and squarefree with at least three factors, they have at least eight square roots of unity, so a random base is very likely to expose one. Korselt's criterion, which protects them from Fermat, is exactly what makes them vulnerable here.

04Frequently asked questions

Are Carmichael numbers rare?

They are sparse but infinite — it was proved in 1994 that infinitely many exist. Below 10^16 there are around 250,000, which is negligible relative to the primes but far too many to enumerate as exceptions.

Is the Fermat test useless?

Not entirely. It is cheap and rejects the overwhelming majority of composites, so it works as a pre-filter. It simply cannot serve as the final test.

Why does the gcd check appear first?

Because a base sharing a factor with n would fail the congruence for an uninteresting reason, and the gcd incidentally reveals a factor. It costs little and occasionally yields a factorisation for free.

Related pages

  • Fermat's Little Theorem and Euler's Theorem
  • The Miller-Rabin Primality Test
  • The Structure of the Group of Units Modulo n

Sources and method

Structural reference: Victor Shoup, A Computational Introduction to Number Theory and Algebra, Version 1, Cambridge University Press, 2005 — book pages 245-247.

This page carries the durable method layer only: definitions, constructions, algorithms, complexity results and selection criteria, authored originally for KEVOS. No text is transcribed or paraphrased from the source, and no numeric tables or benchmark data are reproduced — these are routed to live authoritative sources instead.

Author: Kevin Jogin. Last reviewed 2026-08-07.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review The Fermat Test and Carmichael Numbers. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat The Fermat Test and Carmichael Numbers as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—test, fermat, carmichael, numbers, primality—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

  1. Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
  2. Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
  3. Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
  4. Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
  5. Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

StageRecordQuality check
InputObjects, domain, notation, assumptionsEvery symbol is defined
MethodPermitted operation or cited result at each stepAll hypotheses hold
OutputExact result and representationCorrect type, domain and form
VerificationSubstitution, invariant or alternative derivationIndependent agreement
Boundary testZero, identity, degenerate or failed hypothesisScope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

  • Can every symbol be traced to a definition or prior result?
  • Which hypothesis does each major step use?
  • Does the method cover zero, identity, degenerate and boundary cases?
  • Can the conclusion be checked by a second representation or calculation?
  • Are mandatory requirements distinguished from recommendations and illustrative values?
  • Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
  • Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
  • Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying The Fermat Test and Carmichael Numbers?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Which assumption about test would change the result most if it proved false?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

What evidence would allow an independent reviewer to reproduce or challenge the conclusion?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Which boundary, exception or failure case has not yet been tested?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

What must be handed over, monitored or reviewed after the immediate work is complete?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Authoritative references and use notes

The sources below were selected as institutional or primary guidance for the broader practice. They support the handbook method; they do not imply that every statement or clause in a source applies to every project. Confirm the current edition, jurisdiction, contract and application before treating any requirement as mandatory.

  • MIT OpenCourseWare — Number Theory I — Massachusetts Institute of Technology. Used for algebraic and analytic number theory. Accessed 2026-08-13.
  • MIT OpenCourseWare — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.

Continue learning

The Structure of the Group of Units Modulo nGuide · Engineering MathematicsNEXT LESSON →The Miller-Rabin Primality TestGuide · Engineering MathematicsTrial Division and Basic Primality TestingGuide · Engineering MathematicsGenerating a Random Prime Between 2 and MGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®