query: Combinatorics problem involving selection of digits
positive_passages.docid: 143620
positive_passages.text: How many $n$-digit decimal sequences (using the digits $0 = 9$) are there in which the digits $1$, $2$ and $3$ all appear?
negative_passages.docid: 21598
negative_passages.text: A game of guessing a chosen number
negative_passages.docid: 85023
negative_passages.text: Permutation of n objects with restriction of adjacent pairs
negative_passages.docid: 28183
negative_passages.text: Probability of selecting an even natural number from the set $\Bbb N$.
negative_passages.docid: 129352
negative_passages.text: Duality discrete math problem
negative_passages.docid: 27141
negative_passages.text: Combinatorics identity question
negative_passages.docid: 127069
negative_passages.text: Discrete Math - Counting
negative_passages.docid: 123407
negative_passages.text: Combinatorics - binary - very interesting question
negative_passages.docid: 148703
negative_passages.text: Permutations with repeating digits
negative_passages.docid: 133436
negative_passages.text: Inclusion-Exclusion: INTELLIGENT permutations
negative_passages.docid: 73323
negative_passages.text: Permutations when some objects are alike
negative_passages.docid: 149961
negative_passages.text: Two digit numbers
negative_passages.docid: 157621
negative_passages.text: Combinatorics involving picking a specific amount of consonants without repeat and vowels (can repeat)
negative_passages.docid: 49912
negative_passages.text: Generating ordered combination of numbers
negative_passages.docid: 58103
negative_passages.text: number of permutations in which no two consecutive numbers are adjacent
negative_passages.docid: 20221
negative_passages.text: Combinatorics - Removing Double Counted Cases
negative_passages.docid: 134938
negative_passages.text: Committee combinatorics