Anonymous user
Talk:Combinations with repetitions: Difference between revisions
Talk:Combinations with repetitions (view source)
Revision as of 00:01, 17 November 2010
, 13 years ago→Task definition: Not clear.
(→Task definition: new section) |
(→Task definition: Not clear.) |
||
Line 4:
At this stage, it's very hard for me to work out exactly what is to be implemented; the task gives very little guidance over what a “k-combination with repetition” is exactly (it's not the clearest of wikipedia pages that is linked to). At the very least, I'd expect it to use a simple small example (with as few elements as possible) to show exactly what is meant and how things differ from a standard combination-enumerator; it could then ask for the generation of the combinations for a larger input set. –[[User:Dkf|Donal Fellows]] 23:31, 16 November 2010 (UTC)
:Ditto on the lack of clarity.
:What would be the result of:
n=(1,2,3), k=2;
n=(1,1,2,3), k=2
n=(1,1,1,2,3), k=2
:And how do you compute the result in the general case? --[[User:Paddy3118|Paddy3118]] 00:01, 17 November 2010 (UTC)
| |||