input: from typing import List
  
  
  def solve_problem_recursively(problem: List[float]) -> bool:
      """ Solve a given problem using recursion in Python. 
      A recursion problem is solved by breaking it down into smaller problems,
      until the problem is small enough to be solved directly. The result from a smaller
      problem can then be combined with the result from the larger problem, until the 
      original problem is solved.
      >>> solve_problem_recursively([1.0, 2.0, 3.0])
      True
      >>> solve_problem_recursively([1.0, 2.8, 3.0, 4.0, 5.0, 2.0])
      True
      """
output:     if len(problem) == 1:
          return True
      elif len(problem) == 2:
          return abs(problem[0] - problem[1]) < 1.0
      else:
          mid = len(problem) // 2
          left_result = solve_problem_recursively(problem[:mid])
          right_result = solve_problem_recursively(problem[mid:])
          return left_result and right_result