input: Write a function to check if a given number is prime. If the number is greater than 1, iterate from 2 to the number itself and check if the number is divisible by any of these. If it is, return False. If not, return True. If the number is less than or equal to 1, 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(15)==False
output: def primeCheck(num):
   if num > 1:
    for i in range(2, num):
     if (num % i) == 0:
      return False
   else:
    return False
   return True