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 vote384 views1 answer
Display 2d numpy array as image
Python
1 vote311 views3 answers
Python pdf to excel
Python
0 vote381 views2 answers
How to send one variable to python using xlwings
Python
0 vote346 views1 answer
Python generate html
Python
0 vote339 views2 answers
Flask return html
Python
0 vote340 views2 answers
TypeError: unsupported operand type(s) for +: 'Fraction' and 'Fraction'
Python
1 vote420 views1 answer
Python print no end of line
Python
1 vote332 views1 answer
Import antigravity in python
Python
83 votes339 views6 answers
Py virtual environment
Python
2 votes358 views1 answer
Model pickle file create
Python