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

17 votes239 views3 answers
Python ModuleNotFoundError: No module named '_tkinter'
Python
0 vote248 views1 answer
Python if type dict
Python
0 vote246 views1 answer
Pygame point at mouse
Python
0 vote245 views1 answer
Conditional relationship sqlalchemy
Python
0 vote240 views1 answer
Matplotlig adding progress bar
Python
1 vote242 views1 answer
Python logistic function
Python
5 votes242 views2 answers
Convert response to json python
Python
12 votes253 views2 answers
Isinstance float or int
Python
1 vote257 views2 answers
What is a cube plus b cube
Python
90 votes273 views6 answers
Python get current directory
Python