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

18 votes116 views2 answers
Lists to dictionary python
Python
0 vote107 views1 answer
Program fibonacci series number in python
Python
5 votes116 views5 answers
Nmap
Python
8 votes111 views6 answers
Python int to binary
Python
0 vote112 views1 answer
Python - How To Check if a String Contains Word
Python
0 vote119 views1 answer
DRF: get ip address
Python
0 vote105 views1 answer
Django.db.backends.mysql install
Python
1 vote113 views1 answer
Python tkinter getting labels
Python
-2 votes105 views1 answer
What type of loop does the following Python syntax represent? for i in range(10): print(i)
Python
3 votes124 views5 answers
Max function python
Python