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:
“Utopias are presented for our inspection as a critique of the human state. If they are to be treated as anything but trivial exercises of the imagination. I suggest there is a simple test we can apply.... We must forget the whole paraphernalia of social description, demonstration, expostulation, approbation, condemnation. We have to say to ourselves, “How would I myself live in this proposed society? How long would it be before I went stark staring mad?””
—William Golding (b. 1911)