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 vote101 views3 answers
Django messages
Python
0 vote144 views1 answer
Odoo create new admin user command line
Python
-2 votes187 views2 answers
Django form date picker
Python Django
0 vote184 views1 answer
Python using string to access objects
Python
2 votes134 views2 answers
Convert pdf to csv python
Python
1 vote139 views1 answer
Python text to speech version 3
Python
0 vote160 views1 answer
Saleor docker development
Python
1 vote135 views1 answer
Python logistic function
Python
1 vote172 views1 answer
Python number divisible by two other numbers
Python
0 vote175 views1 answer
Autofield in django
Python Django