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

1 vote210 views2 answers
Kaggle dataset download to google colab
Python
1 vote212 views1 answer
Make a list from 0 to n python
Python
6 votes190 views2 answers
Series.Series to dataframe
Python
-1 vote183 views1 answer
Pseudocode examples for beginners
Python
1 vote214 views1 answer
How to append to every second item in list python
Python
0 vote187 views1 answer
Sort rows in csv file using python pandas
Python
0 vote210 views1 answer
Flask print request headers
Python
1 vote255 views1 answer
Python try then change something and try again if fails
Python
0 vote194 views1 answer
Pouring 8 litres into 2 empty container of size 3 and 5 to get 4 litre in any container
Python
0 vote207 views1 answer
Python to C++ converter
Python