A tetrahedron with four equilateral triangular faces has a sphere inscribed within it and a sphere circumscribed about it. For each of the four faces, there is a sphere tangent externally to the face at its center and to the circumscribed sphere. A point $ P$ is selected at random inside the circumscribed sphere. The probability that $ P$ lies inside one of the five small spheres is closest to $ \textbf{(A)}\ 0\qquad \textbf{(B)}\ 0.1\qquad \textbf{(C)}\ 0.2\qquad \textbf{(D)}\ 0.3\qquad \textbf{(E)}\ 0.4$

A spider has one sock and one shoe for each of its eight legs. In how many different orders can the spider put on its socks and shoes, assuming that, on each leg, the sock must be put on before the shoe? $ \textbf{(A)} \ 8! \qquad \textbf{(B)} \ 2^8 \cdot 8! \qquad \textbf{(C)} \ (8!)^2 \qquad \textbf{(D)} \ \frac {16!}{2^8} \qquad \textbf{(E)} \ 16!$

We roll a regular 6-sided dice $n$ times. What is the probabilty that the total number of eyes rolled is a multiple of 5?

Among the positive integers less than $100$, each of whose digits is a prime number, one is selected at random. What is the probablility that the selected number is prime? $\textbf{(A) } \dfrac{8}{99} \qquad\textbf{(B) } \dfrac{2}{5} \qquad\textbf{(C) } \dfrac{9}{20} \qquad\textbf{(D) } \dfrac{1}{2} \qquad\textbf{(E) } \dfrac{9}{16} $

Given any positive real number $\varepsilon$, prove that, for all but finitely many positive integers $v$, any graph on $v$ vertices with at least $(1+\varepsilon)v$ edges has two distinct simple cycles of equal lengths. (Recall that the notion of a simple cycle does not allow repetition of vertices in a cycle.) [i]Fedor Petrov, Russia[/i]

Let $S$ be a set of size $11$. A random $12$-tuple $(s_1, s_2, . . . , s_{12})$ of elements of $S$ is chosen uniformly at random. Moreover, let $\pi : S \to S$ be a permutation of $S$ chosen uniformly at random. The probability that $s_{i+1}\ne \pi (s_i)$ for all $1 \le i \le 12$ (where $s_{13} = s_1$) can be written as $\frac{a}{b}$ where $a$ and $b$ are relatively prime positive integers. Compute $a$.

In triangle $ ABC$, $ AB \equal{} AC \equal{} 100$, and $ BC \equal{} 56$. Circle $ P$ has radius $ 16$ and is tangent to $ \overline{AC}$ and $ \overline{BC}$. Circle $ Q$ is externally tangent to $ P$ and is tangent to $ \overline{AB}$ and $ \overline{BC}$. No point of circle $ Q$ lies outside of $ \triangle ABC$. The radius of circle $ Q$ can be expressed in the form $ m \minus{} n\sqrt {k}$, where $ m$, $ n$, and $ k$ are positive integers and $ k$ is the product of distinct primes. Find $ m \plus{} nk$.

A [i]triangulation[/i] $ \mathcal{T}$ of a polygon $ P$ is a finite collection of triangles whose union is $ P,$ and such that the intersection of any two triangles is either empty, or a shared vertex, or a shared side. Moreover, each side of $ P$ is a side of exactly one triangle in $ \mathcal{T}.$ Say that $ \mathcal{T}$ is [i]admissible[/i] if every internal vertex is shared by $ 6$ or more triangles. For example [asy] size(100); dot(dir(-100)^^dir(230)^^dir(160)^^dir(100)^^dir(50)^^dir(5)^^dir(-55)); draw(dir(-100)--dir(230)--dir(160)--dir(100)--dir(50)--dir(5)--dir(-55)--cycle); pair A = (0,-0.25); dot(A); draw(A--dir(-100)^^A--dir(230)^^A--dir(160)^^A--dir(100)^^A--dir(5)^^A--dir(-55)^^dir(5)--dir(100)); [/asy] Prove that there is an integer $ M_n,$ depending only on $ n,$ such that any admissible triangulation of a polygon $ P$ with $ n$ sides has at most $ M_n$ triangles.

A red ball and a green ball are randomly and independently tossed into bins numbered with positive integers so that for each ball, the probability that it is tossed into bin $k$ is $2^{-k}$ for $k=1,2,3,\ldots.$ What is the probability that the red ball is tossed into a higher-numbered bin than the green ball? $\textbf{(A) } \frac{1}{4} \qquad\textbf{(B) } \frac{2}{7} \qquad\textbf{(C) } \frac{1}{3} \qquad\textbf{(D) } \frac{3}{8} \qquad\textbf{(E) } \frac{3}{7}$

Let a sequence be defined as follows: $a_0=1$, and for $n>0$, $a_n$ is $\tfrac{1}{3}a_{n-1}$ and is $\tfrac{1}{9}a_{n-1}$ with probability $\tfrac{1}{2}$. If the expected value of $\textstyle\sum_{n=0}^{\infty}a_n$ can be expressed in simplest form as $\tfrac{p}{q}$, what is $p+q$?

Let $ \{A_n\}_{n \in \mathbb{N}}$ be a sequence of measurable subsets of the real line which covers almost every point infinitely often. Prove, that there exists a set $ B \subset \mathbb{N}$ of zero density, such that $ \{A_n\}_{n \in B}$ also covers almost every point infinitely often. (The set $ B \subset \mathbb{N}$ is of zero density if $ \lim_{n \to \infty} \frac {\#\{B \cap \{0, \dots, n \minus{} 1\}\}}{n} \equal{} 0$.)

Using a nozzle to paint each square in a $1 \times n$ stripe, when the nozzle is aiming at the $i$-th square, the square is painted black, and simultaneously, its left and right neighboring square (if exists) each has an independent probability of $\tfrac{1}{2}$ to be painted black. In the optimal strategy (i.e. achieving least possible number of painting), the expectation of number of painting to paint all the squares black, is $T(n)$. Find the explicit formula of $T(n)$.

Real numbers between 0 and 1, inclusive, are chosen in the following manner. A fair coin is flipped. If it lands heads, then it is flipped again and the chosen number is 0 if the second flip is heads and 1 if the second flip is tails. On the other hand, if the first coin flip is tails, then the number is chosen uniformly at random from the closed interval $[0,1]$. Two random numbers $x$ and $y$ are chosen independently in this manner. What is the probability that $|x-y| > \tfrac{1}{2}$? $\textbf{(A)} \frac{1}{3} \qquad \textbf{(B)} \frac{7}{16} \qquad \textbf{(C)} \frac{1}{2} \qquad \textbf{(D)} \frac{9}{16} \qquad \textbf{(E)} \frac{2}{3}$

Six distinct positive integers are randomly chosen between $1$ and $2011;$ inclusive. The probability that some pair of the six chosen integers has a difference that is a multiple of $5 $ is $n$ percent. Find $n.$

There are $256$ players in a tennis tournament who are ranked from $1$ to $256$, with $1$ corresponding to the highest rank and $256$ corresponding to the lowest rank. When two players play a match in the tournament, the player whose rank is higher wins the match with probability $\frac{3}{5}$. In each round of the tournament, the player with the highest rank plays against the player with the second highest rank, the player with the third highest rank plays against the player with the fourth highest rank, and so on. At the end of the round, the players who win proceed to the next round and the players who lose exit the tournament. After eight rounds, there is one player remaining and they are declared the winner. Determine the expected value of the rank of the winner.

Five balls are arranged around a circle. Chris chooses two adjacent balls at random and interchanges them. Then Silva does the same, with her choice of adjacent balls to interchange being independent of Chris's. What is the expected number of balls that occupy their original positions after these two successive transpositions? $(\textbf{A})\: 1.6\qquad(\textbf{B}) \: 1.8\qquad(\textbf{C}) \: 2.0\qquad(\textbf{D}) \: 2.2\qquad(\textbf{E}) \: 2.4$

Let $a$ and $b$ be randomly selected three-digit integers and suppose $a > b$. We say that $a$ is [i]clearly bigger[/i] than $b$ if each digit of $a$ is larger than the corresponding digit of $b$. If the probability that $a$ is clearly bigger than $b$ is $\tfrac mn$, where $m$ and $n$ are relatively prime integers, compute $m+n$. [i]Proposed by Evan Chen[/i]

Starting at $(0, 0)$, Richard takes $2n+1$ steps, with each step being one unit either East, North, West, or South. For each step, the direction is chosen uniformly at random from the four possibilities. Determine the probability that Richard ends at $(1, 0)$.

Suppose $x$ is a random real number between $1$ and $4$, and $y$ is a random real number between $1$ and $9$. If the expected value of \[ \left\lceil \log_2 x \right\rceil - \left\lfloor \log_3 y \right\rfloor \] can be expressed as $\frac mn$ where $m$ and $n$ are relatively prime positive integers, compute $100m + n$. [i]Proposed by Lewis Chen[/i]

A gardener plants three maple trees, four oak trees, and five birch trees in a row. He plants them in random order, each arrangement being equally likely. Let $\frac{m}{n}$ in lowest terms be the probability that no two birch trees are next to one another. Find $m + n$.

Five dice are rolled. The product of the faces are then computed. Which result has a larger probability of occurring; $180$ or $144$?

After a typist has written ten letters and had addressed the ten corresponding envelopes, a careless mailing clerk inserted the letters in the envelopes at random, one letter per envelope. What is the probability that [b]exactly[/b] nine letters were inserted in the proper envelopes?

A fair coin is to be tossed $10$ times. Let $i/j$, in lowest terms, be the probability that heads never occur on consecutive tosses. Find $i+j$.

Let $n$ be given, $n\ge 4,$ and suppose that $P_1,P_2,\dots,P_n$ are $n$ randomly, independently and uniformly, chosen points on a circle. Consider the convex $n$-gon whose vertices are the $P_i.$ What is the probability that at least one of the vertex angles of this polygon is acute.?

If $a$ and $b$ are selected uniformly from $\{0,1,\ldots,511\}$ without replacement, the expected number of $1$'s in the binary representation of $a+b$ can be written in simplest from as $\tfrac{m}{n}$. Compute $m+n$.