Search results
Results from the WOW.Com Content Network
In computational number theory, the Adleman–Pomerance–Rumely primality test is an algorithm for determining whether a number is prime.Unlike other, more efficient algorithms for this purpose, it avoids the use of random numbers, so it is a deterministic primality test.