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 vote138 views10 answers
Test
Python
0 vote120 views1 answer
Accumulator programming python
Python
8 votes116 views2 answers
Reverse python script
Python
0 vote119 views1 answer
Logging store info to different files
Python
1 vote118 views2 answers
Python json write utf 8
Python
0 vote125 views1 answer
Python declare immutable variable
Python
0 vote145 views1 answer
Python selenium get title
Python
2 votes177 views2 answers
Python fibonacci while loop
Python
0 vote117 views1 answer
Check django channels with redis setup
Python
3 votes111 views2 answers
Upgrade python to 3.8
Python