18-Oct-2022 23:36:16

change_diophantine_test():
  MATLAB/Octave version 9.8.0.1380330 (R2020a) Update 2.
  change_diophantine() solves a Diophantine equation
  to determine how to make a sum using a given set of coins.

change_diophantine_test01():
  change_diophantine() solves a change-making problem.

  Test 1:
    5*x1+9*x2+13*x3 = 19
    1 solutions found
    3 coins in minimal solution.

      1:      5*2+9*1+13*0 = 19, coins = 3

  Test 2:
    1*x1+4*x2+5*x3+8*x4+11*x5 = 29
    80 solutions found
    4 coins in minimal solution.
    Too many solutions to print.

  Test 3:
    1*x1+5*x2+10*x3+25*x4+50*x5+100*x6 = 96
    252 solutions found
    5 coins in minimal solution.
    Too many solutions to print.

  Test 4:
    1*x1+2*x2+6*x3+12*x4+24*x5+48*x6+60*x7 = 96
    2771 solutions found
    2 coins in minimal solution.
    Too many solutions to print.

  Test 5:
    1*x1+3*x2+4*x3 = 6
    4 solutions found
    2 coins in minimal solution.

      1:      1*0+3*2+4*0 = 6, coins = 2
      2:      1*2+3*0+4*1 = 6, coins = 3
      3:      1*3+3*1+4*0 = 6, coins = 4
      4:      1*6+3*0+4*0 = 6, coins = 6

  Test 6:
    16*x1+17*x2+23*x3+24*x4+39*x5+40*x6 = 100
    1 solutions found
    6 coins in minimal solution.

      1:      16*2+17*4+23*0+24*0+39*0+40*0 = 100, coins = 6

  Test 7:
    6*x1+9*x2+20*x3 = 43
    0 solutions found
    0 coins in minimal solution.


change_diophantine_test():
  Normal end of execution.

18-Oct-2022 23:36:16