input: Write a function to determine 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, num):
    if (num % i) == 0:
     return False
   else:
    return False
   return True
  assert primeCheck(7)==True
  assert primeCheck(10)==False
  assert primeCheck(1)==False
  assert primeCheck(29)==True
  assert primeCheck(100)==False
output: def primeCheck(num):
      if num <= 1:
          return False
      for i in range(2, int(num**0.5) + 1):
          if num % i == 0:
              return False
      return True