From a bag containing 5 pairs of socks, each pair a different color, a random sample of 4 single socks is drawn. Any complete pairs in the sample are discarded and replaced by a new pair draw from the bag. The process continues until the bag is empty or there are 4 socks of different colors held outside the bag. What is the probability of the latter alternative?

Fix positive integers $n$ and $k$ such that $2 \le k \le n$ and a set $M$ consisting of $n$ fruits. A [i]permutation[/i] is a sequence $x=(x_1,x_2,\ldots,x_n)$ such that $\{x_1,\ldots,x_n\}=M$. Ivan [i]prefers[/i] some (at least one) of these permutations. He realized that for every preferred permutation $x$, there exist $k$ indices $i_1 < i_2 < \ldots < i_k$ with the following property: for every $1 \le j < k$, if he swaps $x_{i_j}$ and $x_{i_{j+1}}$, he obtains another preferred permutation. \\ Prove that he prefers at least $k!$ permutations.

The $ 52$ cards in a deck are numbered $ 1, 2, \ldots, 52$. Alex, Blair, Corey, and Dylan each picks a card from the deck without replacement and with each card being equally likely to be picked, The two persons with lower numbered cards from a team, and the two persons with higher numbered cards form another team. Let $ p(a)$ be the probability that Alex and Dylan are on the same team, given that Alex picks one of the cards $ a$ and $ a\plus{}9$, and Dylan picks the other of these two cards. The minimum value of $ p(a)$ for which $ p(a)\ge\frac12$ can be written as $ \frac{m}{n}$. where $ m$ and $ n$ are relatively prime positive integers. Find $ m\plus{}n$.

There are $4$ distinct codes used in an intelligence station, one of them applied in each week. No two codes used in two adjacent weeks are the same code. Knowing that code $A$ is used in the first week, find the probability that code $A$ is used in the seventh week.

Kelvin and $15$ other frogs are in a meeting, for a total of $16$ frogs. During the meeting, each pair of distinct frogs becomes friends with probability $\frac{1}{2}$. Kelvin thinks the situation after the meeting is [I]cool[/I] if for each of the $16$ frogs, the number of friends they made during the meeting is a multiple of $4$. Say that the probability of the situation being cool can be expressed in the form $\frac{a}{b}$, where $a$ and $b$ are relatively prime. Find $a$.

One student in a class of boys and girls is chosen to represent the class. Each student is equally likely to be chosen and the probability that a boy is chosen is $ \frac23$ of the probability that a girl is chosen. The ratio of the number of boys to the total number of boys and girls is $ \textbf{(A)}\ \frac13 \qquad \textbf{(B)}\ \frac25 \qquad \textbf{(C)}\ \frac12 \qquad \textbf{(D)}\ \frac35 \qquad \textbf{(E)}\ \frac23$

Bob and Bill's history class has $32$ people in it, but only $30$ people are allowed per class. Two people will be randomly selected for transfer to a random one of two history classes. What is the probability that Bob and Bill are both transferred, and that they are placed in the same class? Write your answer as a fraction in lowest terms.

An integer $ x$, with $ 10 \le x \le 99$, is to be chosen. If all choices are equally likely, what is the probability that at least one digit of $ x$ is a $ 7$? $ \textbf{(A)}\ \frac19\qquad \textbf{(B)}\ \frac15\qquad \textbf{(C)}\ \frac{19}{90}\qquad \textbf{(D)}\ \frac29\qquad \textbf{(E)}\ \frac13$

A robot starts at the origin of the Cartesian plane. At each of $10$ steps, he decides to move $ 1$ unit in any of the following directions: left, right, up, or down, each with equal probability. After $10$ steps, the probability that the robot is at the origin is $\frac{n}{4^{10}}$ . Find$ n$

Each of $N$ people chooses a random integer number between $1$ and $19$ (including $1$ and $19$, and not necessarily with the same distribution). The random numbers chosen by the people are independent from each other, and it is true that each person chooses each of the $19$ numbers with probability at most $99\%$. They add up the $N$ chosen numbers, and take the remainder of the sum divided by $19$. Prove that the distribution of the result tends to the uniform distribution exponentially, i.e. there exists a number $0<c<1$ such that the mod $19$ remainder of the sum of the $N$ chosen numbers equals each of the mod $19$ remainders with probability between $\frac{1}{19}-c^{N}$ and $\frac{1}{19}+c^{N}$.

How many positive integers not exceeding $ 2001$ are multiples of $ 3$ or $ 4$ but not $ 5$? $ \textbf{(A)}\ 768 \qquad \textbf{(B)}\ 801 \qquad \textbf{(C)}\ 934 \qquad \textbf{(D)}\ 1067 \qquad \textbf{(E)}\ 1167$

What is the probability that a randomly drawn positive factor of $ 60$ is less than $ 7$? $ \textbf{(A)}\ \frac{1}{10} \qquad \textbf{(B)}\ \frac{1}{6} \qquad \textbf{(C)}\ \frac{1}{4} \qquad \textbf{(D)}\ \frac{1}{3} \qquad \textbf{(E)}\ \frac{1}{2}$

Given positive integers $m$ and $n$, prove that there is a positive integer $c$ such that the numbers $cm$ and $cn$ have the same number of occurrences of each non-zero digit when written in base ten.

There are three balls of distinct colors in a bag. We repeatedly draw out the balls one by one, the balls are put back into the bag after each drawing. What is the probability that, after $n$ drawings, (a) exactly one color occured? (b) exactly two oclors occured? (c) all three colors occured?

A jar contains $2$ yellow candies, $4$ red candies, and $6$ blue candies. Candies are randomly drawn out of the jar one-by-one and eaten. The probability that the $2$ yellow candies will be eaten before any of the red candies are eaten is given by the fraction $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

In a game similar to three card monte, the dealer places three cards on the table: the queen of spades and two red cards. The cards are placed in a row, and the queen starts in the center; the card configuration is thus RQR. The dealer proceeds to move. With each move, the dealer randomly switches the center card with one of the two edge cards (so the configuration after the first move is either RRQ or QRR). What is the probability that, after 2004 moves, the center card is the queen?

Let $S$ be the square one of whose diagonals has endpoints $(0.1,0.7)$ and $(-0.1,-0.7)$. A point $v=(x,y)$ is chosen uniformly at random over all pairs of real numbers $x$ and $y$ such that $0\le x \le 2012$ and $0 \le y \le 2012$. Let $T(v)$ be a translated copy of $S$ centered at $v$. What is the probability that the square region determined by $T(v)$ contains exactly two points with integer coordinates in its interior? $ \textbf{(A)}\ 0.125\qquad\textbf{(B)}\ 0.14\qquad\textbf{(C)}\ 0.16\qquad\textbf{(D)}\ 0.25\qquad\textbf{(E)}\ 0.32 $

In a village with a population of $1000$, two hundred people have been infected by a disease. A diagnostic test can be done to check whether a person is infected, but the result could be erroneous. That is, there is a $5\%$ probability that the test result of an infected person shows that they are not infected and a $5\%$ probability that the test result of a healthy person shows that they are infected. We randomly choose someone from the population of this village and take the diagnostic test from him. What is the probability that the test result declares that person is infected?

A drawer contains a mixture of red socks and blue socks, at most 1991 in all. It so happens that, when two socks are selected randomly without replacement, there is a probability of exactly $1/2$ that both are red or both are blue. What is the largest possible number of red socks in the drawer that is consistent with this data?

A particle moves from $(0, 0)$ to $(n, n)$ directed by a fair coin. For each head it moves one step east and for each tail it moves one step north. At $(n, y), y < n$, it stays there if a head comes up and at $(x, n), x < n$, it stays there if a tail comes up. Let$ k$ be a fixed positive integer. Find the probability that the particle needs exactly $2n+k$ tosses to reach $(n, n).$

At Durant University, an A grade corresponds to raw scores between $90$ and $100$, and a B grade corresponds to raw scores between $80$ and $90$. Travis has $3$ equally weighted exams in his math class. Given that Travis earned an A on his first exam and a B on his second (but doesn't know his raw score for either), what is the minimum score he needs to have a $90\%$ chance of getting an A in the class? Note that scores on exams do not necessarily have to be integers.

Six distinct integers are picked at random from $\{1,2,3,\ldots,10\}$. What is the probability that, among those selected, the second smallest is $3$? $ \textbf{(A)}\ \frac{1}{60}\qquad\textbf{(B)}\ \frac{1}{6}\qquad\textbf{(C)}\ \frac{1}{3}\qquad\textbf{(D)}\ \frac{1}{2}\qquad\textbf{(E)}\ \text{none of these} $

Tyler rolls two $ 4025 $ sided fair dice with sides numbered $ 1, \dots , 4025 $. Given that the number on the first die is greater than or equal to the number on the second die, what is the probability that the number on the first die is less than or equal to $ 2012 $?

Pick a $3$-digit number $abc$, which contains no $0$'s. The probability that this is a winning number is $\frac1a\cdot\frac1b\cdot\frac1c$. However, the BMT problem writer tries to balance out the chances for the numbers in the following ways: [list] [*] For the lowest digit $n$ in the number, he rolls an $n$-sided die for each time that the digit appears, and gives the number $0$ probability of winning if an $n$ is rolled. [*] For the largest digit $m$ in the number, he rolls an $m$-sided die once and scales the probability of winning by that die roll. [/list] If you choose optimally, what is the probability that your number is a winning number?

A pair of six-sided fair dice are labeled so that one die has only even numbers (two each of $2$, $4$, and $6$), and the other die has only odd numbers (two each of $1$, $3$, and $5$). The pair of dice is rolled. What is the probability that the sum of the numbers on top of the two dice is $7$? $ \textbf{(A)}\ \dfrac{1}{6} \qquad\textbf{(B)}\ \dfrac{1}{5} \qquad\textbf{(C)}\ \dfrac{1}{4} \qquad\textbf{(D)}\ \dfrac{1}{3} \qquad\textbf{(E)}\ \dfrac{1}{2} $