input: Write a function to check if a given number is prime. If the number is greater than 1, check if it is divisible by any number from 2 to num-1. If it is divisible, return False, otherwise return True. If the number is less than or equal to 1, return False.
  assert primeCheck(2)==True
  assert primeCheck(3)==True
  assert primeCheck(4)==False
  assert primeCheck(17)==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