prime number in python
def prime(num):
if num>1:
s=int(num/2)
for i in range(2,s+1):
if num%i==0:
return("not prime")
break
return("prime")
print(prime(239))prime number in python
def prime(num):
if num>1:
s=int(num/2)
for i in range(2,s+1):
if num%i==0:
return("not prime")
break
return("prime")
print(prime(239))list of prime numbers in python
n = 20
primes = []
for i in range(2, n + 1):
for j in range(2, int(i ** 0.5) + 1):
if i%j == 0:
break
else:
primes.append(i)
print(primes)python calculate prime numbers until numer
until = 20
[n for n in range(2, until) if all(n % m != 0 for m in range(2, n-1))]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)is_prime in python
# Program to check if a number is prime or not
#too take the input from user use "num: int = int(input('Give the value of num '))"
num: int = int(input('Give the value of Num: '))
# define a variable felix
felix = False
# prime numbers are greater than 1
if num > 1:
# check for factors
for i in range(2, num):
if (num % i) == 0:
# if factor is found, set flag to True
felix = True
# break out of loop
break
# check if flag is True
if felix:
print(num, "is not a prime number")
else:
print(num, "is a prime number")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 smallerCopyright © 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
