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

7 votes225 views1 answer
Save and load sklearn model PKL
Python
25 votes250 views6 answers
Python if
Python
0 vote222 views1 answer
How to import the whall library in python
Python
14 votes238 views3 answers
Flask link stylesheet
Python
0 vote263 views1 answer
Ion Flux Relabeling
Python
0 vote233 views1 answer
Spyder new instance
Python
0 vote245 views1 answer
How to get RGB value from pixel in screen live python
Python
7 votes237 views3 answers
Python selenium click element
Python
0 vote248 views1 answer
Rectangle function numpy
Python
0 vote252 views1 answer
Proper pagination django template
Python Django