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 vote189 views1 answer
Frequency domain parameter of speech
Python
0 vote165 views1 answer
"2 + 2" operación en string python
Python
8 votes203 views2 answers
What does class meta do in django
Python Django
0 vote159 views2 answers
Py search and get objects from array
Python
0 vote186 views2 answers
Add key value in each dictonary in the list
Python
5 votes140 views1 answer
Python read csv into array
Python
26 votes171 views6 answers
Sort list of dictionaries python
Python
0 vote122 views1 answer
How to use randon in python
Python
1 vote168 views2 answers
Python string copy
Python
0 vote191 views1 answer
Django related_name abstract class
Python Django