Primality Test

gbenussi

25 Sep 2012CPOL8 min read

50.7K

168

This article show how we optimize a Primality Test for know if a number is prime or not, and also presents an algorithms (Sieve of Eratosthenes) for calculating the prime numbers for a numbers less than or equal a given numbers efficiently.

This is an old version of the currently published article.

Only logged in members can view this content

Please go to the Algorithms Table of Contents to view the list of available articles in this section.