{{ appName }}

Problem: Given the set of coins {dollars, halfs, quarters, dimes, nickes, pennies}, find all possible subsets of this set (there are {{ numCombinations }} in all, discounting the empty set which could not provide a solution) that use the fewest number (but not zero) of each coin in each set and that minimize the total number of coins in each set providing a total value M (not zero).

Solution: This could be solved very laboriously by trial and error by hand or with a calculator. But there's a better way! Just enter the M value below as a valid money amount and click the Solve button.