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

4 votes166 views1 answer
Python float to fraction
Python
1 vote147 views1 answer
Python convert list to dict with index
Python
0 vote173 views1 answer
Modules django
Python Django
0 vote143 views1 answer
Fake-useragent proxy webscraping browser change
Python
0 vote147 views1 answer
Python dictionary get ket
Python
0 vote143 views1 answer
Turn off warning when import python
Python
1 vote139 views1 answer
Pandas print first column
Python
213 votes348 views6 answers
Python iterate through dictionary
Python
1 vote143 views2 answers
Python sum of natural numbers recursion
Python
0 vote235 views1 answer
Resource punkt not found. Please use the NLTK Downloader to obtain the resource:
Python