input: Write a function to check if a given number is a prime number. The function should return True if the number is prime, otherwise return False. If the number is less than or equal to 1, the function should immediately return False as 1 and all negative numbers are not prime.
  assert primeCheck(2)==True
  assert primeCheck(3)==True
  assert primeCheck(4)==False
  assert primeCheck(5)==True
  assert primeCheck(1)==False
  assert primeCheck(-1)==False
output: def primeCheck(n):
      if n <= 1:
          return False
      for i in range(2, int(n**0.5) + 1):
          if n % i == 0:
              return False
      return True