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 vote144 views1 answer
Python check if all dictionary values are False
Python
2 votes148 views1 answer
Django group with permission
Python
0 vote169 views1 answer
Numpy.empty sorce code
Python
0 vote212 views1 answer
Input in one line python
Python
0 vote228 views1 answer
Ta-lib python install
Python
0 vote152 views1 answer
Argumrnt with reverse django
Python
3 votes150 views2 answers
Python writelines newline
Python
0 vote186 views9 answers
How to form a list from a file in python
Python
1 vote151 views1 answer
Catch error data with except python
Python
8 votes155 views2 answers
How to detect mouse click in pygame
Python