Python prime check

Determine if number is prime python

# 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"

Python prime check

def isPrime(n):
  if n<2:		#1, 0 and all negative numbers are not prime
    return False
  elif n==2:	#2 is prime but cannot be calculated with the formula below becuase of the range function
    return True
  else:
    for i in range(2, n):
      if (n % i) == 0:	#if you can precisely divide a number by another number, it is not prime
        return False
    return True			#if the progam dont return False and arrives here, it means it has checked all the numebrs smaller than n and nono of them divides n. So n is prime

Similar codes

0 vote272 views1 answer
Append to a ldictionary value list
Python
8 votes302 views3 answers
Remove the First Character From the String in Python Using the Slicing
Python
25 votes336 views4 answers
Time in python code
Python
0 vote314 views1 answer
Show all urls django extensions
Python Django
6 votes281 views2 answers
Python min in dictionary
Python
69 votes323 views6 answers
Python dictionary append
Python
0 vote298 views1 answer
Exercices pyton
Python
1 vote359 views1 answer
How to play sound after pressing a button in tkinter
Python
0 vote266 views2 answers
Python open excel application
Python
0 vote285 views1 answer
Python in a nutshell
Python