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

1 vote258 views2 answers
Python print utf-8
Python
6 votes242 views3 answers
Extract frames from video python
Python
21 votes262 views4 answers
Flask quickstart
Python
35 votes245 views6 answers
Install matplotlib
Python
1 vote241 views1 answer
Convert negative to zero in list in python
Python
0 vote267 views1 answer
Python get substring between strings
Python
-1 vote248 views6 answers
Pandas show column with regular expression
Python
11 votes255 views2 answers
Python datetime yesterday
Python
1 vote254 views1 answer
Python how to draw triangle
Python
0 vote272 views1 answer
Python linter online
Python