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 vote220 views1 answer
TypeError: Object of type DictProxy is not JSON serializable
Python
4 votes239 views2 answers
Compare two dictionaries in python
Python
0 vote243 views1 answer
Identifying strings python
Python
0 vote230 views1 answer
Python coule nod import the module virtualenvwrapper.hook_loader
Python
1 vote218 views1 answer
Height width image opencv
Python
25 votes310 views2 answers
Create new django app
Python Django
0 vote237 views1 answer
Python conditions symbols
Python
0 vote219 views1 answer
Rc.local raspberry pi
Python
3 votes208 views1 answer
Datetime.timedelta months
Python
0 vote246 views1 answer
Count number of subdirectories
Python