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

12 votes256 views3 answers
Python for in for in
Python
0 vote273 views1 answer
Delete element from matrix python
Python
1 vote273 views1 answer
From datetime to unix timestamp
Python
19 votes267 views5 answers
Run python file from another python file
Python
1 vote267 views1 answer
How to set axis range matplotlib
Python
0 vote254 views1 answer
Return all values in a list python
Python
12 votes284 views5 answers
Python inf
Python
0 vote282 views1 answer
Python - give a name to index column
Python
1 vote264 views1 answer
Parse youtube video id from youtube link python
Python
44 votes270 views6 answers
Json python
Python