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 vote206 views2 answers
Isinstance in python
Python
13 votes210 views2 answers
Wap in python to check a number is odd or even
Python
4 votes276 views3 answers
Flash messages django
Python Django
1 vote245 views2 answers
Keras sequential layer
Python
91 votes232 views6 answers
Python for in
Python
0 vote193 views1 answer
No module named 'mysite'
Python
2 votes242 views1 answer
How to merge between two columns and make a new one in pandas dataframe
Python
1 vote186 views1 answer
Django model query join
Python
0 vote191 views1 answer
Autopy in python install
Python
0 vote192 views1 answer
How does sns boxplot determine outliers
Python