input: Write a function to find prime numbers up to a given number using Python. The function should iterate from 2 to the given number and print out all prime numbers within that range.
  
  def find_primes(n):
      def is_prime(num):
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return True
  
      for num in range(2, n + 1):
          if is_prime(num):
              print(num)
  
  assert find_primes(10)==None
  # Expected output: 2 3 5 7
  
  assert find_primes(20)==None
  # Expected output: 2 3 5 7 11 13 17 19
  
  assert find_primes(5)==None
  # Expected output: 2 3 5
output: def find_primes(n):
      def is_prime(num):
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return True
  
      for num in range(2, n + 1):
          if is_prime(num):
              print(num)