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 vote100 views1 answer
Python pyhue
Python
3 votes114 views5 answers
Get object attributes python
Python
7 votes125 views1 answer
Python title case
Python
0 vote140 views1 answer
Email slicer in python code user input
Python
0 vote125 views1 answer
Python tuple multiply sequence
Python
1 vote117 views4 answers
Get python script path
Python
3 votes121 views4 answers
Pip install ffmpeg
Python
2 votes101 views1 answer
Open image in numpy
Python
0 vote121 views1 answer
Distplot for 2 columns
Python
0 vote110 views1 answer
Alternatives for appending to numpy array
Python