input: Write a function to check if a given number is prime. If the number is prime return True, otherwise return False.
  
  def primeCheck(num):
   if num > 1:
    for i in range(2, int(num**0.5)+1):
     if (num % i) == 0:
      return False
   else:
    return False
   return True
  
  assert primeCheck(2) == True
  assert primeCheck(3) == True
  assert primeCheck(4) == False
  assert primeCheck(11) == True
  assert primeCheck(100) == False
output: def primeCheck(num):
   if num > 1:
    for i in range(2, int(num**0.5)+1):
     if (num % i) == 0:
      return False
   else:
    return False
   return True