Pseudoprime

related topics
{style, bgcolor, rowspan}
{math, number, function}
{rate, high, increase}

A pseudoprime is a probable prime (an integer that shares a property common to all prime numbers) which is not actually prime. Pseudoprimes can be classified according to which property they satisfy.

Fermat pseudoprimes

Fermat's little theorem states that if p is prime and a is coprime to p, then ap−1 − 1 is divisible by p. If a composite integer x is coprime to an integer a > 1 and x divides ax−1 − 1, then x is called a Fermat pseudoprime to base a. Some sources use variations of this definition, for example to only allow odd numbers to be pseudoprimes.[1]

An integer x that is a Fermat pseudoprime to all values of a that are coprime to x is called a Carmichael number.

Classes

References

Full article ▸

related documents
Palindromic number
Unix shell
1997
1978
1990
1996
Wikipedia:WikiProject French départements
1983
1975
List of Hercules: The Legendary Journeys episodes
List of Star Trek: Deep Space Nine episodes
1976
2006
1993
Wikipedia:Namespace
1982
1991
1959
List of playwrights
International Olympiad in Informatics
1995
Lepontine Alps
1981
Wikipedia:Old bug reports
Carignano
East Flanders
List of elements by name
1979
List of IOC country codes
Flag of Estonia