input: Write a function that takes two numbers as input and returns a dictionary with all the prime numbers between them.
  
  def prime_numbers(x, y):
      prime_nums = {}
      for i in range(x, y+1):
          if i > 1:
              for j in range(2, i):
                  if i % j == 0:
                      break
              else:
                  prime_nums[i] = i
      return prime_nums
  
  assert prime_numbers(8, 20)=={11: 11, 13: 13, 17: 17, 19: 19}
  assert prime_numbers(2, 7)=={2: 2, 3: 3, 5: 5, 7: 7}
  assert prime_numbers(10, 15)=={11: 11, 13: 13}
  assert prime_numbers(20, 25)=={23: 23}
  assert prime_numbers(1, 10)=={2: 2, 3: 3, 5: 5, 7: 7}
output: def prime_numbers(x, y):
      prime_nums = {}
      for i in range(x, y+1):
          if i > 1:
              for j in range(2, i):
                  if i % j == 0:
                      break
              else:
                  prime_nums[i] = i
      return prime_nums