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

30 votes266 views2 answers
Mysql.connector methods python
Python
1 vote288 views2 answers
Keras.callbacks.history
Python
0 vote278 views1 answer
Pandas df.index.values
Python
0 vote275 views2 answers
Python object name
Python
12 votes322 views4 answers
How to add two numbers in python
Python
3 votes310 views2 answers
ModuleNotFoundError: No module named 'decouple'
Python
2 votes280 views2 answers
How to take input in python3 separated by space
Python
1 vote294 views1 answer
Pandas sample rows
Python
0 vote290 views1 answer
Python get all ips in a range
Python
7 votes276 views1 answer
On message discord py
Python