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

2 votes307 views3 answers
Python random number generator no duplicates
Python
0 vote321 views1 answer
Ist comperension python
Python
2 votes296 views5 answers
Pandas rename single column
Python
0 vote298 views1 answer
User passes test django
Python
0 vote296 views1 answer
Selenium click on item in a list
Python
0 vote317 views1 answer
Tree to tuple python
Python
222 votes573 views6 answers
Python random numbers
Python
0 vote288 views1 answer
Iterrrows
Python
3 votes339 views1 answer
Python bounding box on image
Python
0 vote279 views1 answer
Sort lexo python
Python