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

2 votes297 views2 answers
Python primera letra mayuscula
Python
0 vote312 views1 answer
Remove occurence of character from string python
Python
0 vote308 views1 answer
How to encode hexadecimal python
Python
1 vote312 views1 answer
How to download the captions of a youtube video
Python
0 vote307 views1 answer
Rotate existing labels python
Python
0 vote323 views1 answer
Affinity propagation cosine similarity python
Python
0 vote304 views1 answer
Heroku run python manage.py migrate
Python
0 vote297 views1 answer
Python program for printing fibonacci numbers
Python
3 votes346 views3 answers
Run a shell script from python
Python
17 votes311 views4 answers
WARNING: You are using pip version 21.2.3; however, version 21.2.4 is available
Python