⚠️ Warning: This is a draft ⚠️

This means it might contain formatting issues, incorrect code, conceptual problems, or other severe issues.

If you want to help to improve and eventually enable this page, please fork RosettaGit's repository and open a merge request on GitHub.

== draft tasks seem to be born fully-grown lately == Perhaps somebody could comment or add some musings on how old a draft should be before it grows up? -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 21:57, 25 October 2018 (UTC)

== 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: I1x1 + ... + InXn = 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.) The U.S. Post Office has (or used to) print a unique stamp for every cent denomination up to and including \$1. I don't know how many stamps are still being issued for over a (U.S.) dollar anymore.

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 or ™) term(s) and also a registered (R or ®) trade-mark term, but it seems that Wikipedia skipped around those problems. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 21:35, 25 October 2018 (UTC)

==Python: "composing generic abstractions"== What use is the Haskell-like example? Especially when compared to the other Python example. RC is not about showing how to write Haskell in other languages it's about comparing idiomatic solutions in each language (idelly).

I am considering deletng that example. RC is not the place to pursue private vendettas againt Python's percieved lack of support for a pet programming style in its guidelines. ([http://rosettacode.org/wiki/Talk:Cheryl%27s_Birthday Ref]).