prime number in python
import math
a=[i for i in range(2,int(input('prime number range'))) if 0 not in [i%n for n in range(2,int(math.sqrt(i)))]]
print(a)prime number in python
import math
a=[i for i in range(2,int(input('prime number range'))) if 0 not in [i%n for n in range(2,int(math.sqrt(i)))]]
print(a)primes in python
from math import sqrt
for i in range(2, int(sqrt(num)) + 1):
if num % i == 0:
print("Not Prime")
break
print("Prime")
# Note: Use this if your num is big (ex. 10000 or bigger) for efficiency
# The result is still the same if the num is smallerprime checker in python
#make the function
#to do this all hte vairibles go in side the function
def CheckIfPrime ():
a1 = input("which number do you want to check")
a = int(a1)#you need the checking number as an int not an str
b = 2 #the number to check againts
c = ("yes")
while b < a:#run the loop
if a%b == 0:#check if the division has a remainder
c = ("no")#set the answer
b = b+1
print(c)#print the output
CheckIfPrime ()#call the functionprimes python
import math
def main():
count = 3
while True:
isprime = True
for x in range(2, int(math.sqrt(count) + 1)):
if count % x == 0:
isprime = False
break
if isprime:
print count
count += 1Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
