A pseudoprime is a probable prime (an integer that shares a property common to all prime numbers) that is not actually prime. Pseudoprimes are classified according to which property of primes they satisfy.
Some sources use the term pseudoprime about all probable primes, both composite numbers and actual primes.
Pseudoprimes are of primary importance in public-key cryptography, which makes use of the difficulty of factoring large numbers into their prime factors. Carl Pomerance estimated in 1988 that it would cost $10 million to factor a number with 144 digits, and $100 billion to factor a 200-digit number (the cost today is dramatically cheaper but still prohibitively expensive). However, finding and factoring the proper prime numbers for this use is correspondingly expensive, so various probabilistic primality tests are used to find primes amongst large numbers, some of which in rare cases incorrectly identify composite numbers as primes. On the other hand, deterministic primality tests, such as the AKS primality test, do not give false positives; there are no pseudoprimes with respect to them.
Fermat's little theorem states that if p is prime and a is coprime to p, then ap−1 − 1 is divisible by p. For an integer a > 1, if a composite integer x divides ax−1 − 1, then x is called a Fermat pseudoprime to base a. It follows that if x is a Fermat pseudoprime to base a, then x is coprime to a. Some sources use variations of this definition, for example to only allow odd numbers to be pseudoprimes.
An integer x that is a Fermat pseudoprime to all values of a that are coprime to x is called a Carmichael number.