Talk:McNuggets problem: Difference between revisions

You beat me to the punch.   I was going to enter a Rosetta Code problem next week which would've been called the '''Frobenius''' problem or some such   (I'm currently working on the wording of an unrelated Rosetta Code task).

 

I1*x1 + ... + In*Xn = B.

At least two integers should be supplied. If the integers aren't relatively prime,

If any of the integers is equal to '''1''' (unity), then '''0''' (zero) is returned.

Another way of approaching the description of the Frobenius number is: given a set of integer-demoniation

 

This is why this problem is also known as the '''postage-stamp''' problem and was a real problem when buying stamps for mailing a package at the post-office which may have a restricted set of stamps, and people wanted/collected the different stamps, not wanting '''41''' one-cent stamps put on a package or envelope.   (Now-a-days, of course, the post office just produces a digital imprint of the exact decimal postage amount.)   The U.S. Post Office has (or used to print a unique stamp for every denomination up to and including $1.   I don't know how many stamps are still being issued for over a (U.S.) dollar anymore.