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 vote137 views2 answers
How to decrease size of graph in plt.scatter
Python
3 votes140 views1 answer
Text to speech to specific language python
Python
8 votes162 views4 answers
Print pandas version
Python
0 vote141 views1 answer
Counting valleys hackerrank solution python
Python
0 vote139 views1 answer
Pystache unescaped characters
Python
0 vote189 views1 answer
Enumerate in django templte
Python Django
1 vote139 views1 answer
Simple way of finding file extension python programming
Python
0 vote150 views1 answer
Pd sample every class
Python
0 vote138 views1 answer
Df.min python
Python
0 vote135 views1 answer
Derivative of multivariable function pytorch
Python