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

-4 votes335 views5 answers
Current django version
Python Django
0 vote335 views1 answer
Pandas backward fill after upsampling
Python
6 votes356 views3 answers
Download image from url python 3
Python
0 vote362 views1 answer
Make value of two tables unique django
Python
0 vote354 views1 answer
Python branchless programming
Python
0 vote347 views1 answer
Python sum lists element wise
Python
0 vote335 views1 answer
With open python print file name
Python
0 vote344 views1 answer
Repeat array along new axis
Python
0 vote334 views1 answer
Xlabel not showing matplotlib
Python
1 vote332 views1 answer
Cut 0s on string python
Python