有多少种方法可以改变:一些简单的证明
How many ways can you make change: Some easy proofs
摘要:
给定一美元,有多少种方法可以用便士、五分镍币、一角硬币和两角五分硬币找零钱?如果你得到不同数量的钱呢?如果你使用不同的硬币面额?这是一个众所周知的问题,并且公式是已知的。我们在几种情况下提出更简单的证明。如果硬币的面值是{1,x,kx,n},我们使用递归来推导公式,并且我们使用生成函数来推导任何硬币集合的公式。
英文摘要:
Given a dollar, how many ways are there to make change using pennies, nickels, dimes, and quarters? What if you are given a different amount of money? What if you use different coin denominations? This is a well known problem and formulas are known. We present simpler proofs in several cases. We use recurrences to derive formulas if the coin denominations are {1,x,kx,rx}, and we use a simple proof using generating functions to derive a formula for any coin set.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。