Paul fills in a $7\times7$ grid with the numbers $1$ through $49$ in a random arrangement. He then erases his work and does the same thing again, to obtain two different random arrangements of the numbers in the grid. What is the expected number of pairs of numbers that occur in either the same row as each other or the same column as each other in both of the two arrangements?

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?

Chloé chooses a real number uniformly at random from the interval $[0, 2017]$. Independently, Laurent chooses a real number uniformly at random from the interval $[0,4034]$. What is the probability that Laurent's number is greater than Chloé's number? $\textbf{(A)}~\frac12 \qquad \textbf{(B)}~\frac23 \qquad \textbf{(C)}~\frac34 \qquad \textbf{(D)}~\frac56\qquad \textbf{(E)}~\frac78$

Let $n$ be a positive integer. Prove that the number of lines which go through the origin and precisely one other point with integer coordinates $(x,y),0\le x,y\le n$, is at least $\frac{n^2}{4}$.

Echo the gecko starts on the point $(0, 0)$ in the 2D coordinate plane. Every minute, starting at the end of the first minute, he'll teleport $1$ unit up, left, right, or down with equal probability. Echo dies the moment he lands on a point that is more than $1$ unit away from the origin. The average number of minutes he'll live can be expressed as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [i]Team #2[/i]

Let $a$ and $b$ be given positive real numbers, with $a<b.$ If two points are selected at random from a straight line segment of length $b,$ what is the probability that the distance between them is at least $a?$

Positive integers $ a,b,$ and $ c$ are randomly and independently selected with replacement from the set $ \{ 1,2,3,\dots,2010 \}.$ What is the probability that $ abc \plus{} ab \plus{} a$ is divisible by $ 3$? $ \textbf{(A)}\ \dfrac{1}{3} \qquad\textbf{(B)}\ \dfrac{29}{81} \qquad\textbf{(C)}\ \dfrac{31}{81} \qquad\textbf{(D)}\ \dfrac{11}{27} \qquad\textbf{(E)}\ \dfrac{13}{27}$

A cube is formed from $n^3$ ($n \ge 2$) unit cubes, each painted white on five randomly selected sides. This cube is dipped into paint remover and broken into the original unit cubes. What is the expected number of these unit cubes with exactly four sides painted white?

Given is a $n \times n$ chessboard. With the same probability, we put six pawns on its six cells. Let $p_n$ denotes the probability that there exists a row or a column containing at least two pawns. Find $\lim_{n \to \infty} np_n$.

An envelope contains eight bills: $ 2$ ones, $ 2$ fives, $ 2$ tens, and $ 2$ twenties. Two bills are drawn at random without replacement. What is the probability that their sum is $ \$ 20$ or more? $ \textbf{(A)}\ \frac {1}{4}\qquad \textbf{(B)}\ \frac {2}{7}\qquad \textbf{(C)}\ \frac {3}{7}\qquad \textbf{(D)}\ \frac {1}{2}\qquad \textbf{(E)}\ \frac {2}{3}$

For each positive integer $n$, define $H_n(x)=(-1)^ne^{x^2}\frac{d^n}{dx^n}e^{-x^2}.$ (1) Find $H_1(x),\ H_2(x),\ H_3(x)$. (2) Express $\frac{d}{dx}H_n(x)$ interms of $H_n(x),\ H_{n+1}(x).$ Then prove that $H_n(x)$ is a polynpmial with degree $n$ by induction. (3) Let $a$ be real number. For $n\geq 3$, express $S_n(a)=\int_0^a xH_n(x)e^{-x^2}dx$ in terms of $H_{n-1}(a),\ H_{n-2}(a),\ H_{n-2}(0)$. (4) Find $\lim_{a\to\infty} S_6(a)$. If necessary, you may use $\lim_{x\to\infty}x^ke^{-x^2}=0$ for a positive integer $k$.

If you roll six fair dice, let $\mathsf{ p}$ be the probability that exactly five different numbers appear on the upper faces of the six dice. If $\mathsf{p} = \frac{m}{n}$ where $ m $ and $n$ are relatively prime positive integers, find $m+n.$

Let $a_1,a_2,...,a_9$ be nine real numbers, not necessarily distinct, with average $m$. Let $A$ denote the number of triples $1 \le i < j < k \le 9$ for which $a_i + a_j + a_k \ge 3m$. What is the minimum possible value of $A$? [i]Proposed by Ray Li[/i]

Three distinct integers are selected at random between $1$ and $2016$, inclusive. Which of the following is a correct statement about the probability $p$ that the product of the three integers is odd? $\textbf{(A)}\ p<\dfrac{1}{8}\qquad\textbf{(B)}\ p=\dfrac{1}{8}\qquad\textbf{(C)}\ \dfrac{1}{8}<p<\dfrac{1}{3}\qquad\textbf{(D)}\ p=\dfrac{1}{3}\qquad\textbf{(E)}\ p>\dfrac{1}{3}$

An object moves $ 8$ cm in a straight line from $ A$ to $ B$, turns at an angle $ \alpha$, measured in radians and chosen at random from the interval $ (0,\pi)$, and moves $ 5$ cm in a straight line to $ C$. What is the probability that $ AC<7$? $ \textbf{(A)}\ \frac{1}{6} \qquad \textbf{(B)}\ \frac{1}{5} \qquad \textbf{(C)}\ \frac{1}{4} \qquad \textbf{(D)}\ \frac{1}{3} \qquad \textbf{(E)}\ \frac{1}{2}$

Given regular hexagon $ABCDEF$, compute the probability that a randomly chosen point inside the hexagon is inside triangle $PQR$, where $P$ is the midpoint of $AB$, $Q$ is the midpoint of $CD$, and $R$ is the midpoint of $EF$.

Let $n$ be a positive integer. Let $f(n)$ be the probability that, if divisors $a, b, c$ of $n$ are selected uniformly at random with replacement, then $\gcd(a, \text{lcm}(b, c)) = \text{lcm}(a, \gcd(b, c))$. Let $s(n)$ be the sum of the distinct prime divisors of $n$. If $f(n) < \frac{1}{2018}$, compute the smallest possible value of $s(n)$.

In fencing, you win a round if you are the first to reach $15$ points. Suppose that when $A$ plays against $B$, at any point during the round, $A$ scores the next point with probability $p$ and $B$ scores the next point with probability $q=1-p$. (However, they never can both score a point at the same time.) Suppose that in this round, $A$ already has $14-k$ points, and $B$ has $14-\ell$ (where $0\le k,\ell\le 14$). By how much will the probability that $A$ wins the round increase if $A$ scores the next point?

Alice, Bob, and Carol repeatedly take turns tossing a die. Alice begins; Bob always follows Alice; Carol always follows Bob; and Alice always follows Carol. Find the probability that Carol will be the first one to toss a six. (The probability of obtaining a six on any toss is $ \frac{1}{6}$, independent of the outcome of any other toss.) $ \textbf{(A)}\ \frac{1}{3}\qquad \textbf{(B)}\ \frac{2}{9}\qquad \textbf{(C)}\ \frac{5}{18}\qquad \textbf{(D)}\ \frac{25}{91}\qquad \textbf{(E)}\ \frac{36}{91}$

Seven people of seven different ages are attending a meeting. The seven people leave the meeting one at a time in random order. Given that the youngest person leaves the meeting sometime before the oldest person leaves the meeting, the probability that the third, fourth, and fifth people to leave the meeting do so in order of their ages (youngest to oldest) is $\frac{m}{n}$ , where m and n are relatively prime positive integers. Find $m + n$.

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]

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?

We are given a coin of diameter $\frac{1}{2}$ and a checkerboard of $1\times1$ squares of area $2010\times2010$. We toss the coin such that it lands completely on the checkerboard. If the probability that the coin doesn't touch any of the lattice lines is $\frac{a^2}{b^2}$ where $\frac{a}{b}$ is a reduced fraction, find $a+b$

Ten people apply for a job. The manager decides to interview the candidates one by one according to the following conditions: i) the first three candidates will not be employed; ii) from the fourth candidates onwards, if a candidate's comptence surpasses the competence of all those who preceded him, then that candidate is employed; iii) if the first nine candidates are not employed, then the tenth candidate will be employed. We assume that none of the $10$ applicants have the same competence, and these competences can be ranked from the first to tenth. Let $P_k$ represent the probability that the $k$th-ranked applicant in competence is employed. Prove that: i) $P_1>P_2>\ldots>P_8=P_9=P_{10}$; ii) $P_1+P_2+P_3>0.7$ iii) $P_8+P_9+P_{10}\le 0.1$. [i]Su Chun[/i]

Let there be $n$ students, numbered $1$ through $n$. Let there be $n$ cards with numbers $1$ through $n$ written on them. Each student picks a card from the stack, and two students are called a pair if they pick each other's number. Let the probability that there are no pairs be $p_n$. Prove that $p_n - p_{n-1}=0$ if $n$ is odd, and prove that $p_n - p_{n-1}= \frac{1}{(-2)^kk^{1-k}}$ if $n = 2k$.