w3resource
Python Exercises

Python: Sieve of Eratosthenes method, for computing prime number

Python List: Exercise - 34 with Solution

Write a Python program using Sieve of Eratosthenes method for computing primes upto a specified number.

Note: In mathematics, the sieve of Eratosthenes (Ancient Greek: κόσκινον Ἐρατοσθένους, kóskinon Eratosthénous), one of a number of prime number sieves, is a simple, ancient algorithm for finding all prime numbers up to any given limit.

Python: Sieve of Eratosthenes method, for computing prime number

From Wikipedia Sieve of Eratosthenes: algorithm steps for primes below 121 (including optimization of starting from prime's square).

Sample Solution:-

Python Code:

def prime_eratosthenes(n):
    prime_list = []
    for i in range(2, n+1):
        if i not in prime_list:
            print (i)
            for j in range(i*i, n+1, i):
                prime_list.append(j)

print(prime_eratosthenes(100))';

Sample Output:

2                                                                                                             
3                                                                                                             
5                                                                                                             
7                                                                                                             
11                                                                                                            
-------
79                                                                                                            
83                                                                                                            
89                                                                                                            
97                                                                                                            
None   

Flowchart:

Flowchart: Sieve of Eratosthenes method, for computing prime numbers

Python Code Editor:

Have another way to solve this solution? Contribute your code (and comments) through Disqus.

Previous: Write a Python program to generate all sublists of a list.
Next:Write a Python program to create a list by concatenating a given list which range goes from 1 to n.

What is the difficulty level of this exercise?