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

3 votes272 views1 answer
Import py to exe
Python
0 vote207 views2 answers
Hwo to download video using pytube highest resolution
Python
0 vote183 views1 answer
Pandas df trim columns if too much missing data
Python
0 vote266 views1 answer
Python bin function without 0b
Python
0 vote186 views1 answer
Python runtime
Python
0 vote170 views1 answer
Python convert images to pdf
Python
0 vote181 views1 answer
What is xarray
Python
0 vote185 views1 answer
1 12 123 python
Python
0 vote191 views1 answer
Write lines python with line breaks
Python
5 votes199 views3 answers
Pandas show duplicate rows
Python