query: Given an array of sorted integers, how can I find if there exists a set of 3 elements that sum to K?
positive_passages.docid: 41533
positive_passages.text: Finding three elements in an array whose sum is closest to a given number
negative_passages.docid: 142303
negative_passages.text: Alternating sum of binomial coefficients multiplied by (1/k+1)
negative_passages.docid: 54442
negative_passages.text: Sum of $k {n \choose k}$ is $n2^{n-1}$
negative_passages.docid: 70354
negative_passages.text: Find the sum of all the multiples of 3 or 5 below 1000
negative_passages.docid: 22973
negative_passages.text: Show that an integer of the form $8k + 7$ cannot be written as the sum of three squares.
negative_passages.docid: 147766
negative_passages.text: Sum of Permutations from 0 to n
negative_passages.docid: 104704
negative_passages.text: Evaluate $\sum\limits_{k=0}^n \binom{n}{k}$ combinatorially
negative_passages.docid: 626
negative_passages.text: Sum of combinations with varying $n$
negative_passages.docid: 106397
negative_passages.text: Counting ways to partition a set into fixed number of subsets
negative_passages.docid: 34452
negative_passages.text: In how many ways can you choose $k$ numbers out of $\{1,2,3,\dots,n\}$ so none of them is consecutive?
negative_passages.docid: 150281
negative_passages.text: Am I on the right track to figure out this combinatorics problem?
negative_passages.docid: 77547
negative_passages.text: Find integers $a,b,c,d$ such that
negative_passages.docid: 120095
negative_passages.text: How many ways to split n elements in k groups?
negative_passages.docid: 142978
negative_passages.text: combinatorics: sum of product of integer compositions
negative_passages.docid: 69194
negative_passages.text: Partitioning sum of squares
negative_passages.docid: 155605
negative_passages.text: Find combinations in arrays
negative_passages.docid: 107010
negative_passages.text: How many elements of order $k$ are in $S_n$?