Python primality test

# 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"

Similar codes

0 vote359 views1 answer
Django today date in template
Python Django
0 vote292 views1 answer
Raspistill timelapse
Python
24 votes311 views6 answers
Palindrome python
Python
2 votes302 views1 answer
Random date python
Python
1 vote307 views1 answer
Jupyter notebook delete the output
Python
0 vote300 views1 answer
Python look for image on screen
Python
0 vote305 views1 answer
KeyError: 'PROJ_LIB'
Python
0 vote300 views1 answer
Instead of: firstName = "John" lastName = "Henry" city = "Manchester"
Python
71 votes369 views4 answers
List loop python
Python
0 vote312 views1 answer
Python as-lookup
Python