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 vote322 views1 answer
Mask and then fillnan#
Python
0 vote345 views1 answer
You are trying to add a non-nullable field without a default
Python
0 vote312 views1 answer
How to make a var in pycode
Python
-1 vote320 views4 answers
Python creare decoratori
Python
2 votes336 views1 answer
Pandas dataframe aggregations
Python
0 vote297 views1 answer
While attempts > 0:
Python
0 vote335 views1 answer
Django querset group by sum
Python Django
0 vote319 views1 answer
Range coding
Python
4 votes354 views2 answers
Primary key django model
Python Django
0 vote315 views1 answer
Python get num chars
Python