<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def make_pairs_for_model(model_num=0):
 """ Create a list of pairs of model nums; play every model nearby, then every other model after that, then every fifth, etc. """

    if model_num == 0:
        return
    pairs = []

    mm_fib = lambda n: int((np.matrix([[2,1],[1,1]])**(n//2))[0,(n+1)%2])

    for i in range(2,14): # Max is 233
      if mm_fib(i) >= model_num:
        break
      pairs += [[model_num, model_num - mm_fib(i)]]

    return pairs