Uploaded January 2013 | Updated September 2026, 2 weeks ago

---

See complete series on maths problems here:
youtube.com/playlist?list=PL2_aWCzGMAwLL-mEB4ef20f3iqWMGWa25
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: youtube.com/watch?v=7VPA-HjjUmU
Wikipedia link for Sieve of eratosthenes: en.wikipedia.org/wiki/Sieve_of_Eratosthenes