python algorithm for prime numbers code example
Example 1: determine if number is prime python
# Time Efficient Primality Check in Python
def primeCheck(n):
# 0, 1, even numbers greater than 2 are NOT PRIME
if n==1 or n==0 or (n % 2 == 0 and n > 2):
return "Not prime"
else:
# Not prime if divisable by another number less
# or equal to the square root of itself.
# n**(1/2) returns square root of n
for i in range(3, int(n**(1/2))+1, 2):
if n%i == 0:
return "Not prime"
return "Prime"
Example 2: 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))