The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we help you to solve your academic and programming questions fast.
Watch related videos of your favorite subject.
Connect with students from different parts of the world.
See Our team
Wondering how we keep quality?
Got unsolved questions?

PROGRAMMINGMACHINE-LEARNING-->View question

## Write a Program to print all prime numbers up to a given number?

its about Write a Program to print all prime numbers up to a given number

Taged users:

Likes:
Be first to like this question

Dislikes:
Be first to dislike this question

A  approach is based on the fact that one of the divisors must be smaller than or equal to √n. So we check for divisibility only till √n.

# function to check if the number is

# prime or not

def isPrime(n) :

# Corner cases

if (n <= 1) :

return False

if (n <= 3) :

return True

# This is checked so that we can skip

# middle five numbers in below loop

if (n % 2 == 0 or n % 3 == 0) :

return False

i = 5

while(i * i <= n) :

if (n % i == 0 or n % (i + 2) == 0) :

return False

i = i + 6

return True

# print all prime numbers

# less than equal to N

def printPrime(n):

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

if isPrime(i):

print (i, end =" ")

n = 7

printPrime(n)

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer

### Watch more videos from this user Here

Learn how to upload a video and start earning here

Lets together make the web is a better place

We made eduladder by keeping the ideology of building a supermarket of all the educational material available under one roof. We are doing it with the help of individual contributors like you, interns and employees. So the resources you are looking for can be easily available and accessible also with the freedom of remix reuse and reshare our content under the terms of creative commons license with attribution required close.

You can also contribute to our vision of "Helping student to pass any exams" with these.