query: Generating all "from n choose k" configurations of a simple list
positive_passages.docid: 153174
positive_passages.text: How can I get every distinct size-n combination of a list?
negative_passages.docid: 20973
negative_passages.text: How can I find all the subsets of a set, with exactly n elements?
negative_passages.docid: 66038
negative_passages.text: How can I efficiently generate a Set from a List structure?
negative_passages.docid: 3568
negative_passages.text: Fast way to get a position of combination (without repetitions)
negative_passages.docid: 118158
negative_passages.text: How do I generate a list of n unique random numbers in Ruby?
negative_passages.docid: 93748
negative_passages.text: Alternative to Subsets to generate k-combinations
negative_passages.docid: 74730
negative_passages.text: Combinatorial Proof of ${{n}\choose{k}} {{k}\choose{j}} = {{n}\choose{j}} {{n-j}\choose{k-j}}$
negative_passages.docid: 67926
negative_passages.text: $S_n$ is generated by elements of the form $(1k)$
negative_passages.docid: 90423
negative_passages.text: JavaScript - Generating combinations from n arrays with m elements
negative_passages.docid: 116647
negative_passages.text: The number of different ways to choose $k$ out of $n$ unique items
negative_passages.docid: 41365
negative_passages.text: Choice function for collection of arbitrary finite sets. AC required?
negative_passages.docid: 130514
negative_passages.text: best way to pick a random subset from a collection?
negative_passages.docid: 14979
negative_passages.text: Making all possible combinations of a list
negative_passages.docid: 35886
negative_passages.text: Generating all Possible Combinations
negative_passages.docid: 75223
negative_passages.text: Generate all possible permutations (or n-tuples)
negative_passages.docid: 3786
negative_passages.text: Help finding a combinatorial proof of $k {n \choose k } = n {n - 1 \choose k -1}\;$
negative_passages.docid: 25769
negative_passages.text: Finding all posets on a set