prime number in python without for else 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 generator prime numbers

# effiecent and fast way to generate prime numbers
def primeCheck(n):
    if n == 1 or n == 0 or (n % 2 == 0 and n > 2):
        return False
    else:
        for o in range(3, int(n ** (1 / 2)) + 1, 2):
            if n % o == 0:
                return False
        return True


for a in range(2**15):
    if primeCheck(a):
        prime_numbers.append(a)