input: Write a function to check if a given number is prime. If the number is less than or equal to 1, the function should return False. Otherwise, the function should check if the number is divisible by any integer from 2 up to the number itself. If it is divisible, return False; otherwise, return True.
  assert primeCheck(2)==True
  assert primeCheck(3)==True
  assert primeCheck(4)==False
  assert primeCheck(5)==True
  assert primeCheck(1)==False
output: def primeCheck(n):
      if n <= 1:
          return False
      for i in range(2, n):
          if n % i == 0:
              return False
      return True