input: Write a function to determine if a given number is prime. The function should check divisibility from 2 up to the square root of the number. If the number is divisible by any of these values, it should return False. If the number is not divisible by any of these values, it should return True. Additionally, the function should iterate from 2 to n and print each prime number found.
  
  def is_prime(num):
      # Iterate from 2 to the square root of the number
      for i in range(2, int(num ** 0.5) + 1):
          if num % i == 0:
              return False
      return True
  
  # Iterate from 2 to n
  for n in range(2, n+1):
      # Check if the number is prime
      if is_prime(n):
          print(n)
  
  assert is_prime(5) == True
  assert is_prime(6) == False
  assert is_prime(11) == True
  assert is_prime(15) == False
  assert is_prime(29) == True
output: def is_prime(num):
      if num < 2:
          return False
      for i in range(2, int(num ** 0.5) + 1):
          if num % i == 0:
              return False
      return True
  
  for n in range(2, n+1):
      if is_prime(n):
          print(n)