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 vote325 views2 answers
Bst in python
Python
10 votes305 views6 answers
How to create a variable in python
Python
0 vote295 views1 answer
How to create a python virtual environment in linux
Python
0 vote369 views2 answers
Remove rows if not matching with value in df
Python
0 vote341 views1 answer
Dataframe select row by index value
Python
103 votes360 views6 answers
Install opencv python
Python
0 vote333 views1 answer
Dataframe python diplay 2 tables on same line
Python
0 vote405 views1 answer
Protobuf python
Python
20 votes335 views4 answers
Python time execution
Python
0 vote341 views1 answer
Herons rule python
Python