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

40 votes161 views2 answers
String to list
Python
0 vote162 views2 answers
Conda install dash
Python
0 vote210 views1 answer
Series summation in Python
Python
1 vote305 views1 answer
ModuleNotFoundError: No module named 'lmdb'
Python
7 votes172 views2 answers
"How to get the remainder of a number when dividing in python"
Python
3 votes164 views1 answer
Disable images selenium python
Python
0 vote285 views1 answer
Set difference in multidimensional array numpy
Python
0 vote169 views1 answer
Why we need open ( ) and close ( ) in os
Python
1 vote194 views1 answer
Jupyter notebook reload module
Python
0 vote212 views1 answer
How to remove some lines border from plt plot
Python