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 vote267 views1 answer
Python zeros to nan
Python
-2 votes272 views2 answers
+= python
Python
5 votes306 views2 answers
Python convert string to yaml
Python
2 votes251 views1 answer
Read a csv file in pandas
Python
0 vote268 views1 answer
Df.loc a list of index
Python
1 vote266 views1 answer
Python run 2 functions at the same time
Python
0 vote296 views1 answer
Pandas describe kurtosis skewness
Python
10 votes301 views3 answers
Convert a dictionary into dataframe python
Python
0 vote280 views1 answer
Set .difference() Operation in python3
Python
2 votes297 views3 answers
Python seaborn color map
Python