Primality Test

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. A primality test is an algorithm for determining whether an input number is prime. Amongst other fields of mathematics, it is used for cryptography. The difference between this and integer factorization is that a primality test doesn't necessarily give prime factors (it only states whether the input number is prime or not), while integer factorization does. As of 2009[update], factorization is a computationally hard problem, whereas primality testing is comparatively easy (its running time is polynomial). Some primality tests prove that a number is prime, while others prove that a number is composite. Therefore we might call the latter compositeness tests instead of primality tests.

Pagina's: 116, Paperback, Betascript Publishers