input: Write a function to determine if a given number is prime by checking for divisors up to its square root. If the number has no divisors other than 1 and itself, return True; otherwise, return False. Apply this function to iterate through numbers 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(2)==True
  assert is_prime(3)==True
  assert is_prime(4)==False
  assert is_prime(5)==True
  assert is_prime(6)==False
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