-
Elliptic pseudoprime Euler pseudoprime Euler–Jacobi
pseudoprime Fermat pseudoprime Frobenius pseudoprime Lucas pseudoprime Perrin pseudoprime Somer–Lucas...
-
composites also p****,
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...
-
Lucas pseudoprimes and
Fibonacci pseudoprimes are
composite integers that p****
certain tests which all
primes and very few
composite numbers p****: in...
- In mathematics, 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...
- In
number theory, a
Frobenius pseudoprime is a
pseudoprime,
whose definition was
inspired by the
quadratic Frobenius test
described by Jon
Grantham in...
- case it is
called a
strong pseudoprime, and a {\displaystyle a} is a
strong liar. No
composite number is a
strong pseudoprime to all
bases at the same time...
-
above congruence, then n is
called an Euler–Jacobi
pseudoprime (or, more commonly, an
Euler pseudoprime) to base a. As long as a is not a
multiple of n (usually...
- In mathematics, a
Catalan pseudoprime is an odd
composite number n
satisfying the
congruence ( − 1 ) n − 1 2 ⋅ C n − 1 2 ≡ 2 ( mod n ) , {\displaystyle...
- property.
Carmichael numbers are also
called Fermat pseudoprimes or
absolute Fermat pseudoprimes. A
Carmichael number will p**** a
Fermat primality test...
