|
24 Sep 2012
Updated: 25 Sep 2012
Rating: 4.25/5
Votes: 4
Popularity: 2.56
Licence: CPOL
Views: 50,666
Bookmarked: 7
Downloaded: 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.
|
Submit an article or tip