input: Write a function to rewrite the given code snippet to find prime numbers using Python.
  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