query: Drawer probability problem
positive_passages.docid: 157208
positive_passages.text: Statistics: Bertrand's Box Paradox
negative_passages.docid: 132921
negative_passages.text: Counting problem, number of moves
negative_passages.docid: 107964
negative_passages.text: Simple combinatorics problem.
negative_passages.docid: 7382
negative_passages.text: Probability of getting between
negative_passages.docid: 149455
negative_passages.text: Probability question with interarrival times
negative_passages.docid: 53449
negative_passages.text: Probability brain teaser with infinite loop
negative_passages.docid: 117760
negative_passages.text: The drawer has M different colored socks. What is the least amount of socks I that I need to draw to guarntee N pairs
negative_passages.docid: 84721
negative_passages.text: Probability combinatorics deck of cards
negative_passages.docid: 152107
negative_passages.text: Classic Circle and Adjacent Arrangement Problem
negative_passages.docid: 79341
negative_passages.text: Question on a probability question
negative_passages.docid: 139039
negative_passages.text: Stars and Bars Combinatorics Problem
negative_passages.docid: 40439
negative_passages.text: about a difficult and weird Probability question
negative_passages.docid: 114115
negative_passages.text: Probability: $n$ balls into $n$ holes with exactly one hole remaining empty
negative_passages.docid: 74451
negative_passages.text: What is the probability of rolling $n$ dice until each side appears at least once?
negative_passages.docid: 84543
negative_passages.text: Probability of finding a pattern
negative_passages.docid: 95452
negative_passages.text: Probablity of drawing all the red balls while blue and green are still left
negative_passages.docid: 5794
negative_passages.text: Probability that the sum of $k$ dice is $n$