query: Calculate all possibilities to get N using values from a given set
positive_passages.docid: 154571
positive_passages.text: Algorithm to find elements best fitting in a particular amount
negative_passages.docid: 115236
negative_passages.text: Calculate the sum of inverse values of ${n\choose 0}, {n\choose 1}, ... {n\choose n}$
negative_passages.docid: 19284
negative_passages.text: Using sets of arguments from a list
negative_passages.docid: 76405
negative_passages.text: Let n be an even integer. How many different ways can I choose subsets of the set {1,2...,n}
negative_passages.docid: 98850
negative_passages.text: A positional number system for enumerating fixed-size subsets?
negative_passages.docid: 146098
negative_passages.text: Number of nonempty subsets of a set with $n$ elements
negative_passages.docid: 33873
negative_passages.text: Get all the combinations of N elements of multidimensional array
negative_passages.docid: 153174
negative_passages.text: How can I get every distinct size-n combination of a list?
negative_passages.docid: 69827
negative_passages.text: Set conditions at a permutation
negative_passages.docid: 28453
negative_passages.text: Finding all partitions of a set
negative_passages.docid: 48535
negative_passages.text: Obtaining a powerset of a set in Java
negative_passages.docid: 8149
negative_passages.text: Algorithm to return all combinations of k elements from n
negative_passages.docid: 57822
negative_passages.text: Number of ways to choose two disjoint subsets of a set
negative_passages.docid: 134200
negative_passages.text: Most Efficient Way to Calculate the Product of All Items in a List?
negative_passages.docid: 126288
negative_passages.text: Find the Set With Given Condition
negative_passages.docid: 104274
negative_passages.text: Express $C$ interms of the sets $A_n$
negative_passages.docid: 75223
negative_passages.text: Generate all possible permutations (or n-tuples)