Probable Prime
In number theory, a probable prime (PRP) is an integer that satisfies a specific condition also satisfied by all prime numbers. Different types of probable primes have different specific conditions. While there may be probable primes that are composite (called pseudoprimes), the condition is generally chosen in order to make such exceptions rare.
Fermat's test for compositeness, which is based on Fermat's little theorem, works as follows: given an integer n, choose some integer a coprime to n and calculate an − 1 modulo n. If the result is different from 1, n is composite. If it is 1, n may or may not be prime; n is then called a (weak) probable prime to base a.
Read more about Probable Prime: Properties, Variations
Famous quotes containing the words probable and/or prime:
“It is probable that the principal credit of miracles, visions, enchantments, and such extraordinary occurrences comes from the power of imagination, acting principally upon the minds of the common people, which are softer.”
—Michel de Montaigne (1533–1592)
“Few white citizens are acquainted with blacks other than those projected by the media and the so—called educational system, which is nothing more than a system of rewards and punishments based upon one’s ability to pledge loyalty oaths to Anglo culture. The media and the “educational system” are the prime sources of racism in the United States.”
—Ishmael Reed (b. 1938)