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

5 votes177 views1 answer
Python generate id
Python
4 votes173 views1 answer
Drop Rows by Index in dataframe
Python
0 vote178 views1 answer
Python multiple items in with statment
Python
0 vote199 views1 answer
Dict to csv keys as rows and subkey as columns in python
Python
5 votes239 views4 answers
Debugging in python
Python
0 vote192 views1 answer
How to implement ctrl + C in terminal by using code
Python
0 vote188 views1 answer
Como inserir um elemento num set em python
Python
7 votes177 views2 answers
Python pillow crop image
Python
0 vote214 views1 answer
Django cms api create page
Python Django
24 votes204 views2 answers
How to check the type of a variable in python
Python