input: Write a function to determine if a given number is prime or composite. If the number is prime, return True; otherwise, return False. If the number is less than or equal to 1, return False.
  def is_prime(num):
      if num <= 1:
          return False
      for i in range(2, num):
          if num % i == 0:
              return False
      return True
  
  assert is_prime(10) == False
  assert is_prime(2) == True
  assert is_prime(1) == False
  assert is_prime(11) == True
  assert is_prime(17) == True
output: def is_prime(num):
      if num <= 1:
          return False
      for i in range(2, int(num**0.5) + 1):
          if num % i == 0:
              return False
      return True