1.Previous
3.Next

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, the latter might more accurately be called compositeness tests instead of primality tests.

1.Previous
3.Next