You have four fair $6$-sided dice, each numbered $1$ to $6$ (inclusive). If all four dice are rolled, the probability that the product of the rolled numbers is prime can be written as $\tfrac{a}{b}$, where $a$ and $b$ are relatively prime. What is $a+b$?

Twenty-seven players are randomly split into three teams of nine. Given that Zack is on a different team from Mihir and Mihir is on a different team from Andrew, what is the probability that Zack and Andrew are on the same team?

Six cards with numbers 1, 1, 3, 4, 4, 5 are given. We are drawing 3 cards from 6 given cards one by one and are forming a three-digit number with the numbers over the cards drawn according to the drawing order. Find the probability that this three-digit number is a multiple of 3. (The card drawn is not put back) $\textbf{(A)}\ \frac {1}{5} \qquad\textbf{(B)}\ \frac {2}{5} \qquad\textbf{(C)}\ \frac {3}{7} \qquad\textbf{(D)}\ \frac {1}{2} \qquad\textbf{(E)}\ \text{None}$

In a standard game of Rock–Paper–Scissors, two players repeatedly choose between rock, paper, and scissors, until they choose different options. Rock beats scissors, scissors beats paper, and paper beats rock. Nathan knows that on each turn, Richard randomly chooses paper with probability $33\%$, scissors with probability $44\%$, and rock with probability $23\%$. If Nathan plays optimally against Richard, the probability that Nathan wins is expressible as $a/b$ where $a$ and $b$ are coprime positive integers. Find $a + b$.

An ordinary domino tile can be identified as a pair $(k,m)$ where numbers $k$ and $m$ can get values $0, 1, 2, 3, 4, 5$ and $6.$ Pairs $(k,m)$ and $(m, k)$ determine the same tile. In particular, the pair $(k, k)$ determines one tile. We say that two domino tiles [i]match[/i], if they have a common component. [i]Generalized n-domino tiles[/i] $m$ and $k$ can get values $0, 1,... , n.$ What is the probability that two randomly chosen $n$-domino tiles match?

[4] Let $D$ be the set of divisors of $100$. Let $Z$ be the set of integers between $1$ and $100$, inclusive. Mark chooses an element $d$ of $D$ and an element $z$ of $Z$ uniformly at random. What is the probability that $d$ divides $z$?

A box contains $5$ chips, numbered $1$, $2$, $3$, $4$, and $5$. Chips are drawn randomly one at a time without replacement until the sum of the values drawn exceeds $4$. What is the probability that $3$ draws are required? $\textbf{(A)} \frac{1}{15} \qquad \textbf{(B)} \frac{1}{10} \qquad \textbf{(C)} \frac{1}{6} \qquad \textbf{(D)} \frac{1}{5} \qquad \textbf{(E)} \frac{1}{4}$

A computer generates even integers half of the time and another computer generates even integers a third of the time. If $a_i$ and $b_i$ are the integers generated by the computers, respectively, at time $i$, what is the probability that $a_1b_1 +a_2b_2 +\cdots + a_kb_k$ is an even integer.

In the set of $20$ elements $\{1, 2, 3, 4, 5, 6, 7, 8, 9, 0, A, B, C, D, J, K, L, U, X, Y , Z\}$ we have made a random sequence of $28$ throws. What is the probability that the sequence $CUBA \ JULY \ 1987$ appears in this order in the sequence already thrown?

Consider a function $f$ on nonnegative integers such that $f(0)=1, f(1)=0$ and $f(n)+f(n-1)=nf(n-1)+(n-1)f(n-2)$ for $n \ge 2$. Show that \[\frac{f(n)}{n!}=\sum_{k=0}^n \frac{(-1)^k}{k!}\]

Jacob uses the following procedure to write down a sequence of numbers. First he chooses the first term to be $ 6$. To generate each succeeding term, he flips a fair coin. If it comes up heads, he doubles the previous term and subtracts $ 1$. If it comes up tails, he takes half of the previous term and subtracts $ 1$. What is the probability that the fourth term in Jacob's sequence is an integer? $ \textbf{(A)}\ \frac{1}{6} \qquad \textbf{(B)}\ \frac{1}{3} \qquad \textbf{(C)}\ \frac{1}{2} \qquad \textbf{(D)}\ \frac{5}{8} \qquad \textbf{(E)}\ \frac{3}{4}$

Let $p_n(k)$ be the number of permutations of the set $\{1,2,3,\ldots,n\}$ which have exactly $k$ fixed points. Prove that $\sum_{k=0}^nk p_n(k)=n!$.[i](IMO Problem 1)[/i] [b][i]Original formulation [/i][/b] Let $S$ be a set of $n$ elements. We denote the number of all permutations of $S$ that have exactly $k$ fixed points by $p_n(k).$ Prove: (a) $\sum_{k=0}^{n} kp_n(k)=n! \ ;$ (b) $\sum_{k=0}^{n} (k-1)^2 p_n(k) =n! $ [i]Proposed by Germany, FR[/i]

Let $A$, $B$, $C$, and $D$ be the vertices of a regular tetrahedron, each of whose edges measures 1 meter. A bug, starting from vertex $A$, observes the following rule: at each vertex it chooses one of the three edges meeting at that vertex, each edge being equally likely to be chosen, and crawls along that edge to the vertex at its opposite end. Let $p = n/729$ be the probability that the bug is at vertex $A$ when it has crawled exactly 7 meters. Find the value of $n$.

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} $

$A,B,C$ are playing backgammon tournament. At first, $A$ plays with $B$. Then the winner plays with $C$. As the tournament goes on, the last winner plays with the player who did not play in the previous game. When a player wins two successive games, he will win the tournament. If each player has equal chance to win a game, what is the probability that $C$ wins the tournament? $ \textbf{(A)}\ \frac27 \qquad\textbf{(B)}\ \frac13 \qquad\textbf{(C)}\ \frac3{14} \qquad\textbf{(D)}\ \frac 17 \qquad\textbf{(E)}\ \text{None} $

Four fair six-sided dice are rolled. What is the probability that at least three of the four dice show the same value? $ \textbf{(A) } \frac{1}{36} \qquad\textbf{(B) } \frac{7}{72} \qquad\textbf{(C) } \frac{1}{9} \qquad\textbf{(D) }\frac{5}{36}\qquad\textbf{(E) }\frac{1}{6} \qquad $

[4] Let $x_1,x_2,\ldots,x_{100}$ be defined so that for each $i$, $x_i$ is a (uniformly) random integer between $1$ and $6$ inclusive. Find the expected number of integers in the set $\{x_1,x_1+x_2,\ldots,x_1+x_2+\cdots+x_{100}\}$ that are multiples of $6$.

An "unfair" coin has a $2/3$ probability of turning up heads. If this coin is tossed $50$ times, what is the probability that the total number of heads is even? $ \textbf{(A)}\ 25\left(\frac{2}{3}\right)^{50}\qquad\textbf{(B)}\ \frac{1}{2}\left(1 - \frac{1}{3^{50}}\right)\qquad\textbf{(C)}\ \frac{1}{2}\qquad\textbf{(D)}\ \frac{1}{2}\left(1 + \frac{1}{3^{50}}\right)\qquad\textbf{(E)}\ \frac{2}{3} $

Una rolls $6$ standard $6$-sided dice simultaneously and calculates the product of the $6{ }$ numbers obtained. What is the probability that the product is divisible by $4?$ $\textbf{(A)}\: \frac34\qquad\textbf{(B)} \: \frac{57}{64}\qquad\textbf{(C)} \: \frac{59}{64}\qquad\textbf{(D)} \: \frac{187}{192}\qquad\textbf{(E)} \: \frac{63}{64}$

A bee is moving in three-dimensional space. A fair six-sided die with faces labeled $A^+, A^-, B^+, B^-, C^+$, and $C^-$ is rolled. Suppose the bee occupies the point $(a, b, c)$. If the die shows $A^+$, then the bee moves to the point $(a+1, b, c)$ and if the die shows $A^-$, then the bee moves to the point $(a-1, b, c)$. Analogous moves are made with the other four outcomes. Suppose the bee starts at the point $(0, 0, 0)$ and the die is rolled four times. What is the probability that the bee traverses four distinct edges of some unit cube? $ \textbf{(A) }\frac{1}{54} \qquad \textbf{(B) }\frac{7}{54} \qquad \textbf{(C) }\frac{1}{6} \qquad \textbf{(D) }\frac{5}{18} \qquad \textbf{(E) }\frac{2}{5} \qquad $

Keiko tosses one penny and Ephraim tosses two pennies. The probability that Ephraim gets the same number of heads that Keiko gets is $\text{(A)}\ \dfrac{1}{4} \qquad \text{(B)}\ \dfrac{3}{8} \qquad \text{(C)}\ \dfrac{1}{2} \qquad \text{(D)}\ \dfrac{2}{3} \qquad \text{(E)}\ \dfrac{3}{4}$

One player conceals a $10$ or $20$ copeck coin, and the other guesses its value. If he is right he gets the coin, if wrong he pays $15$ copecks. Is this a fair game? What are the optimal mixed strategies for both players?

Suppose that there are 100 seats in a saloon for 100 students. All students except one know their seat. First student (which is the one who doesn't know his seat) comes to the saloon and sits randomly somewhere. Then others enter the saloon one by one. Every student that enters the saloon and finds his seat vacant, sits there and if he finds his seat occupied he sits somewhere else randomly. Find the probability that last two students sit on their seats.

Two ducks, Wat and Q, are taking a math test with $1022$ other ducklings. The test has $30$ questions, and the $n$th question is worth $n$ points. The ducks work independently on the test. Wat gets the $n$th problem correct with probability $\frac{1}{n^2}$ while Q gets the $n$th problem correct with probability $\frac{1}{n+1}$. Unfortunately, the remaining ducklings each answer all $30$ questions incorrectly. Just before turning in their test, the ducks and ducklings decide to share answers! On any question which Wat and Q have the same answer, the ducklings change their answers to agree with them. After this process, what is the expected value of the sum of all $1024$ scores? [i]Proposed by Evan Chen[/i]

Five girls and five boys randomly sit in ten seats that are equally spaced around a circle. The probability that there is at least one diameter of the circle with two girls sitting on opposite ends of the diameter is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.