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 vote239 views1 answer
Python increase one item in list
Python
0 vote187 views1 answer
Find root of the path of file os package
Python
2 votes187 views2 answers
Install python3.7 ubuntu 20.04
Python
3 votes337 views2 answers
Django get parameters from url
Python Django
0 vote190 views1 answer
Start and end index in python
Python
0 vote188 views1 answer
Raspbian run a python script at startup
Python
0 vote211 views1 answer
List comprehensions with dates
Python
3 votes188 views1 answer
Python iterate letters
Python
1 vote216 views1 answer
Raise_for_status() requests
Python
57 votes201 views6 answers
Timedelta python
Python