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 vote160 views1 answer
Pytorch dataloader to numpy array
Python
0 vote169 views1 answer
Fibonacci sequence in python using a for loop
Python
5 votes160 views2 answers
Hide console in python build
Python
0 vote164 views1 answer
Doomsday fuel foobar
Python
1 vote159 views1 answer
How to draw shape square in python turtle
Python
2 votes160 views1 answer
Mulitplication symbo for unpacking in python
Python
0 vote155 views2 answers
Plt.text background alpha
Python
-1 vote155 views1 answer
Matrix python math
Python
0 vote174 views1 answer
Python drop the first word
Python
2 votes157 views1 answer
How to reapete the code in python
Python