input: from typing import List
  
  def is_prime(num: int) -> bool:
      """ Check if a given number is prime by evaluating divisibility from 2 up to the 
      square root of the number.
      >>> is_prime(2)
      True
      >>> is_prime(4)
      False
      >>> is_prime(29)
      True
      """
      for i in range(2, int(num ** 0.5) + 1):
          if num % i == 0:
              return False
      return True
  
  def find_prime_numbers(n: int) -> List[int]:
      """ Find all prime numbers from 2 up to a given number n and return them as a list.
      >>> find_prime_numbers(10)
      [2, 3, 5, 7]
      >>> find_prime_numbers(20)
      [2, 3, 5, 7, 11, 13, 17, 19]
      """
      primes = []
      for num in range(2, n + 1):
          if is_prime(num):
              primes.append(num)
      return primes
output:     primes = []
      for num in range(2, n + 1):
          if is_prime(num):
              primes.append(num)
      return primes