改变问题的组合数学
Combinatorics of the change-making problem
摘要：
我们研究的结构的货币（系统的硬币）的贪婪的变化，使算法总是找到一个最优解（即一个最小数量的硬币）。我们提出了一系列的必要条件，必须满足的价值硬币在这样的系统。我们还发现了这些货币和它们的子货币之间的一些关系。
英文摘要：
We investigate the structure of the currencies (systems of coins) for which the greedy change-making algorithm always finds an optimal solution (that is, a one with minimum number of coins). We present a series of necessary conditions that must be satisfied by the values of coins in such systems. We also uncover some relations between such currencies and their sub-currencies.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
