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

-1 vote240 views2 answers
How to url encode using python django
Python Django
0 vote217 views2 answers
How to split string with comma in python
Python
11 votes197 views2 answers
Python optional arguments
Python
10 votes205 views2 answers
Prime number
Python
28 votes181 views6 answers
Flatten list python
Python
0 vote274 views1 answer
Python use math
Python
4 votes200 views1 answer
Get prime number python
Python
21 votes203 views5 answers
How to open a website using python
Python
0 vote202 views1 answer
Kinesis Client get_records example
Python
5 votes207 views3 answers
Convert list to dataframe
Python