input: Write a function to check if a given number is prime. If the number is less than or equal to 1, it should return False. If the number is greater than 1, the function should check for factors from 2 to the number itself. If any factor is found, it should return False, else it should return True.
  
  def primeCheck(num):
   if num <= 1:
    return False
   for i in range(2, num):
    if (num % i) == 0:
     return False
   return True
  
  assert primeCheck(7)==True
  assert primeCheck(10)==False
  assert primeCheck(1)==False
  assert primeCheck(2)==True
  assert primeCheck(11)==True
output: def primeCheck(num):
   if num <= 1:
    return False
   for i in range(2, num):
    if (num % i) == 0:
     return False
   return True