Primality test

From Simple English Wikipedia, the free encyclopedia

A Primality test is a method (or algorithm) to find out if a certain number is a prime number. Cryptography uses prime numbers, and needs to test if a certain number is prime.

[edit] Simple methods

  • Sieve of Eratosthenes: Determine if there is a number (between 2 and n, the number to test) that divides n, without a rest

[edit] Better methods

.