Skip to content

Finding prime number upto a certain range by sieve of eratosthenes #400

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
harshlohia11 wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Finding prime number upto a certain range by sieve of eratosthenes #400

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
40c55a9
Counting number of primes sieve of eralothenes
harshlohia11 Sep 13, 2020
ae97c2e
Counting number of primes sieve of eralothenes
harshlohia11 Sep 13, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
13 changes: 13 additions & 0 deletions algorithms/miscellaneous/sieveoferalothenes.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
#this progran will check for prime numbers to a certain range and if the prime is prime it will display True else False
import math
n=int(input("Enter the number"))
isPrime=[]
for i in range(n):
isPrime.append(True) #assigning the array to False uptil n
isPrime[0]=False
isPrime[1]=False
for i in range(2,int(math.sqrt(n)),1):
for j in range(2*i,n,i): #checking for prime numbers
isPrime[j]=False
for i in range(0,n,1):
print(i,":",isPrime[i])