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 vote170 views1 answer
Def areEquallyStrong(yourLeft, yourRight, friendsLeft, friendsRight):python execution
Python
0 vote160 views2 answers
Iqr in python
Python
1 vote162 views1 answer
How to find the most similar word in a list in python
Python
0 vote208 views1 answer
A sorted set in python
Python
0 vote169 views1 answer
Test pypi
Python
78 votes170 views6 answers
Main python
Python
1 vote149 views2 answers
Print Table Using While Loop In Python
Python
0 vote219 views1 answer
Django charfield force lowercase
Python Django
0 vote207 views2 answers
Python - Comment vérifier une corde contient un nombre
Python
0 vote218 views1 answer
Cannot cast type smallint to boolean django
Python Django