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 vote137 views1 answer
Plot line2d on axis
Python
1 vote201 views1 answer
Python replace all new lines with space
Python
1 vote164 views1 answer
Python zip extract directory
Python
2 votes159 views1 answer
Reverse order np array
Python
2 votes146 views2 answers
Label encoding
Python
1 vote153 views1 answer
Animations text terminal python
Python
0 vote226 views1 answer
Iterate through csv python
Python
106 votes184 views6 answers
How to install opencv
Python
0 vote189 views1 answer
Open file rw python
Python
1 vote156 views1 answer
How to change a thread name in python
Python