change_diophantine_test, an Octave code which calls change_diophantine(), which sets up a Diophantine equation to solve the change making problem, which counts the number of ways a given sum can be formed using coins of various denominations.
The computer code and data files described and made available on this web page are distributed under the MIT license
change_diophantine, an Octave code which sets up a Diophantine equation to solve the change making problem, which counts the number of ways a given sum can be formed using coins of various denominations.