input: Write a function to check if a given number is prime. If the number is prime return True else return False. 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
    return True
   return False
  
  assert primeCheck(2) == True
  assert primeCheck(7) == True
  assert primeCheck(10) == False
  assert primeCheck(1) == False
  assert primeCheck(-5) == 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
   return False