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

32 votes111 views4 answers
Copy to clipboard python
Python
0 vote100 views1 answer
Master python
Python
0 vote89 views1 answer
Installing python3.9 on linux mint 20
Python
1 vote102 views1 answer
Ctx.save_for_backward
Python
0 vote102 views1 answer
String acharacters count in python without using len
Python
24 votes172 views5 answers
Remove a part of a string python
Python
0 vote112 views1 answer
TypeError: unhashable type: 'list' drop duplicates
Python
0 vote92 views3 answers
How to draw dendrogram in python
Python
6 votes97 views2 answers
Python 2d array append
Python
0 vote113 views2 answers
Loop only to the 6th element python
Python