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 vote309 views1 answer
Ia
Python
0 vote305 views1 answer
Multiplication of two or more numbers in python
Python
2 votes323 views1 answer
QTextEdit get text
Python
0 vote312 views1 answer
How to change speed in ursina
Python
0 vote295 views1 answer
TypeError at /admin/auth/user/
Python
0 vote312 views1 answer
Inject dynamic value into string python
Python
18 votes440 views3 answers
Export flask app
Python Flask
0 vote331 views1 answer
List of python keywords
Python
13 votes299 views1 answer
What is a slug
Python
0 vote296 views1 answer
Uppy tus
Python