Click here to Skip to main content
15,881,882 members
Articles / General Programming / Algorithms

Primality Test

Rate me:
Please Sign up or sign in to vote.
4.25/5 (4 votes)
25 Sep 2012CPOL8 min read 50.6K   168   7  
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.

Views

Daily Counts

Downloads

Weekly Counts

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)


Written By
Student
Chile Chile
Software Engineering Student at the University of Santiago de Chile. Interested in new technologies and the impact they produce.

Comments and Discussions