Saturday 13 August 2022

Day 52 : Primes Numbers smaller than or equal to the Number

 

def SieveOfEratosthenes(n):

    primes = [True] * (n + 1)

    p = 2             # because p is the smallest prime

    while(p * p <= n):

        # if p is not marked as False, this it is a prime

        if(primes[p]) == True:

            # mark all the multiples of number as False

            for i in range(p * 2, n + 1, p):

                primes[i] = False

        p += 1        

    # printing all primes

    for i in range(2, n):

        if primes[i]:

            print(i)

if __name__ == '__main__':

    n=int(input("Enter a no to check all smaller prime numbers :"))

    SieveOfEratosthenes(n)

    #clcoding.com

Enter a no to check all smaller prime numbers :20
2
3
5
7
11
13
17
19


0 Comments:

Post a Comment

Popular Posts

Categories

AI (27) Android (24) AngularJS (1) Assembly Language (2) aws (17) Azure (7) BI (10) book (4) Books (114) C (77) C# (12) C++ (82) Course (60) Coursera (176) coursewra (1) Cybersecurity (22) data management (11) Data Science (89) Data Strucures (6) Deep Learning (9) Django (6) Downloads (3) edx (2) Engineering (14) Excel (13) Factorial (1) Finance (5) flutter (1) FPL (17) Google (19) Hadoop (3) HTML&CSS (46) IBM (25) IoT (1) IS (25) Java (92) Leet Code (4) Machine Learning (44) Meta (18) MICHIGAN (5) microsoft (3) Pandas (3) PHP (20) Projects (29) Python (742) Python Coding Challenge (194) Questions (2) R (70) React (6) Scripting (1) security (3) Selenium Webdriver (2) Software (17) SQL (40) UX Research (1) web application (8)

Followers

Person climbing a staircase. Learn Data Science from Scratch: online program with 21 courses