In number theory, a probable prime (PRP) is an integer that satisfies a specific condition that is satisfied by all prime numbers, but which is not satisfied by most composite 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.
I:n number theory, a probable prime (PRP) is an integer that satisfies a specific condition that is satisfied by ?all prime numbers, but which is not satisfied by most composite numbers. Different :types of probable primes have different speci.fic conditions. While there may be probable primes that are composite (c!alled pseudoprimes), the condition is generally chosen in order to make such exceptions rare.