Elliptic pseudoprime Euler pseudoprime Euler–Jacobi pseudoprime Fermat pseudoprime Frobenius pseudoprime Lucas pseudoprime Perrin pseudoprime Somer–Lucas...

Lucas pseudoprimes and Fibonacci pseudoprimes are composite integers that pass certain tests which all primes and very few composite numbers pass: in...

composites also pass, making them "pseudoprimes". Unlike the Fermat pseudoprimes, for which there exist numbers that are pseudoprimes to all coprime bases (the...

In number theory, the Fermat pseudoprimes make up the most important class of pseudoprimes that come from Fermat's little theorem. Fermat's little theorem...

property. Carmichael numbers are also called Fermat pseudoprimes or absolute Fermat pseudoprimes. A Carmichael number will pass a Fermat primality test...

In number theory, a Frobenius pseudoprime is a pseudoprime, whose definition was inspired by the quadratic Frobenius test described by Jon Grantham in...

In arithmetic, an odd composite integer n is called an Euler pseudoprime to base a, if a and n are coprime, and a ( n − 1 ) / 2 ≡ ± 1 ( mod n ) {\displaystyle...

Euler–Jacobi pseudoprime is also a Fermat pseudoprime and an Euler pseudoprime. There are no numbers which are Euler–Jacobi pseudoprimes to all bases...

in which case it is called a strong pseudoprime, and a is a strong liar. No composite number is a strong pseudoprime to all bases at the same time (contrary...

conditions. While there may be probable primes that are composite (called pseudoprimes), the condition is generally chosen in order to make such exceptions...