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

12 votes311 views3 answers
Python for in for in
Python
11 votes203 views6 answers
Pandas group by count
Python
0 vote190 views1 answer
Python double underscore methods
Python
7 votes205 views2 answers
Pandas read_csv ignore unnamed columns
Python
0 vote211 views1 answer
Multiple sub in single regex
Python
0 vote193 views2 answers
Bar plot group by pandas
Python
0 vote211 views3 answers
Missing Data Plotly Express px.data
Python
0 vote191 views1 answer
Fibonacci sequence in python 2.7
Python
0 vote242 views1 answer
Django check if user is staff in template
Python Django
0 vote174 views1 answer
UTC to ISO 8601 with Local TimeZone information without microsecond (Python 3):
Python