Talk:McNuggets problem: Difference between revisions
(added a talk section.) |
m (→task name: added more verbiage.) |
||
| Line 1: | Line 1: | ||
== task name == |
== task name == |
||
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 (I'm currently working on the wording of an unrelated Rosetta Code task). |
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). |
||
The function <big>'''Frobenius'''</big>(a list of some numbers) returns the largest number for the Frobenius equation: |
The function <big>'''Frobenius'''</big>(a list of some numbers) returns the largest number for the Frobenius equation: |
||
| Line 10: | Line 10: | ||
stamps (say, '''4¢''' and '''9¢'''), what is the largest value that those stamps can't represent? |
stamps (say, '''4¢''' and '''9¢'''), what is the largest value that those stamps can't represent? |
||
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.) |
|||
This is why this problem is also known as the '''postage-stamp''' problem. |
|||
I would have added some sets of numbers that have no highest value, as well as "stamps" that are multiples of another. |
|||
I would not have restricted the high limit to '''100''', but left that open-ended (in other words, infinity). |
I would not have restricted the high limit to '''100''', but left that open-ended (in other words, infinity). |
||
Revision as of 21:44, 25 October 2018
task name
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).
The function Frobenius(a list of some numbers) returns the largest number for the Frobenius equation:
I1*x1 + ... + In*Xn = B.
At least two integers should be supplied. If the integers aren't relatively prime,
the result is infinity and is indicated by a negative one (-1) which is returned.
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
stamps (say, 4¢ and 9¢), what is the largest value that those stamps can't represent?
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.)
I would have added some sets of numbers that have no highest value, as well as "stamps" that are multiples of another.
I would not have restricted the high limit to 100, but left that open-ended (in other words, infinity).
It would also get around the use of a trade-marked (TM) term(s) and also a registered (R) trade-mark term, but it seems that Wikipedia skipped around those problems. &bsp; -- Gerard Schildberger (talk) 21:35, 25 October 2018 (UTC)