Finding Prime numbers Sieve of Eratosthenes

>> YOUR LINK HERE: ___ http://youtube.com/watch?v=eKp56OLhoQs

See complete series on maths problems here: • • Mathematics for Programmers • Sieve of Eratosthenes is a very famous and efficient algorithm to generate all small prime numbers up to around 1-10 million. This is an ancient algorithm given by a Greek mathematician named Eratosthenes. We will write a simple program for prime number generation using this algorithm. • Please go through our previous lesson to understand prime number testing using trial division method: • Verify a Prime number - Trial divisio... • Wikipedia link for Sieve of eratosthenes: http://en.wikipedia.org/wiki/Sieve_of...

#############################

New on site