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

1 vote119 views1 answer
How to find range of dates in between two dates unsing python
Python
0 vote106 views6 answers
Assign dictionary a value from a list python
Python
0 vote136 views1 answer
Pandas df.index.values
Python
9 votes137 views2 answers
Argc python
Python
4 votes129 views2 answers
Mode code python
Python
0 vote138 views1 answer
Python cast number to between 0 and 1
Python
-1 vote132 views2 answers
Np.apply_along_axis third dimension python
Python
2 votes169 views3 answers
Streamlit pip
Python
69 votes128 views6 answers
Python dictionary append
Python
0 vote138 views1 answer
How to print the text new line instead of n in jupyter notebook
Python