python isprime 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: python is a number prime

def prime(n):
  if min(n//3,n//2,n//5) == 0: 
    return True
  elif min(n%3,n%2,n%5) == 0: 
    return False
  else: 
    return True

# Super easy to use, and maximum efficiency! No imports needed.
print(prime(732))

def divis(n):
  if prime(n) == True: 
    return (1,n)
  for i in [2,3,5]:
    if n%i == 0: 
      return (i,n/i)

print(divis(735))
# Gets a divisibility pair: Make sure you have also implemented prime() or it may not work.

Example 3: isprime function in python

def isPrime(n):
    if n > 1:  
        for i in range(2,n):  
            if (n % i) == 0:  
                return False
        return True
    else:
        return False

Example 4: check if a number is prime python

n=input('Enter the number you want to check: ')
try:
    n=int(n)
except:
    print('Wrong input.')
    quit()
if n==1 or n==0:
    print('This is neither prime nor composite')
else:
    c=0
    for i in range(2,n):
        if n%i==0:
            c=c+1
    if c==0:
        print("This is a prime number")
    else:
        print('This  is a composite number.')