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