A primality test is an algorithm for determining whether an input number is prime. Amongst other fields of mathematics, it is used for cryptography. Unlike integer factorization, primality tests do not generally give prime factors, only stating whether the input number is prime or not. Factorization is thought to be a computationally difficult problem, whereas primality testing is comparatively easy (its running time is polynomial in the size of the input). Some primality tests prove that a number is prime, while others like Miller–Rabin prove that a number is composite. Therefore we might call the latter compositeness tests instead of primality tests.
Read more about Primality Test: Naive Methods, Probabilistic Tests, Fast Deterministic Tests, Complexity, Number-theoretic Methods
Famous quotes containing the word test:
“There is a parallel between the twos and the tens. Tens are trying to test their abilities again, sizing up and experimenting to discover how to fit in. They don’t mean everything they do and say. They are just testing. . . . Take a good deal of your daughter’s behavior with a grain of salt. Try to handle the really outrageous as matter-of-factly as you would a mistake in grammar or spelling.”
—Stella Chess (20th century)