1. Primality testA 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. Factorization is a computationally difficult problem, whereas primality testing is comparatively easy (its running time is polynomial in the size of the input).
Read “Primality test” on English Wikipedia
Read “素数判定” on Japanese Wikipedia
Read “Primality test” on DBpedia
Read “Primality test” on English Wikipedia
Read “素数判定” on Japanese Wikipedia
Read “Primality test” on DBpedia
Discussions
Log in to talk about this word.