input: Write a function to check if a given number is prime. If the number is less than or equal to 1, return False. Otherwise, check if the number is divisible by any integer from 2 up to the number itself. If it is divisible by any of these integers, return False. If none of these integers can divide the number, return True.
  
  ### Input:
  def primeCheck(num):
  
  ### Output:
  def primeCheck(num):
   if num <= 1:
     return False
   for i in range(2, num):
     if num % i == 0:
       return False
   return True
  
  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:
     return False
   for i in range(2, num):
     if num % i == 0:
       return False
   return True