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 votes218 views1 answer
How to check if file exists pyuthon
Python
1 vote201 views1 answer
Simple gui for pygame
Python
3 votes224 views2 answers
Python inline print variable
Python
5 votes241 views3 answers
Python subplot space between plots
Python
0 vote223 views1 answer
Islink(node1 node2) is used for
Python
0 vote206 views1 answer
Python empty array length n grepper
Python
0 vote210 views1 answer
How to make code only go once python
Python
18 votes221 views5 answers
Continue statement in python
Python
0 vote255 views1 answer
Python send commands in one line but write in multiple
Python
0 vote237 views1 answer
Abstract user in django
Python Django