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 vote170 views1 answer
Purpose of migration folder in django
Python
13 votes123 views3 answers
Python array looping
Python
1 vote121 views3 answers
Link in embed discord.py
Python
0 vote118 views1 answer
Sprints for fat loss
Python
4 votes116 views1 answer
Python remove duplicates words from string
Python
0 vote79 views2 answers
Leetcode diagonal sum
Python
0 vote128 views1 answer
Custom_settings in scrpay
Python
0 vote120 views1 answer
Find the item with the maximum number of occurrences in a list in Python
Python
2 votes114 views3 answers
String contains element of list python
Python
0 vote127 views2 answers
Label binarizer
Python