Abe holds 1 green and 1 red jelly bean in his hand. Bea holds 1 green, 1 yellow, and 2 red jelly beans in her hand. Each randomly picks a jelly bean to show the other. What is the probability that the colors match? $\textbf{(A)}\ \frac14 \qquad \textbf{(B)}\ \frac13 \qquad \textbf{(C)}\ \frac38 \qquad \textbf{(D)}\ \frac12 \qquad \textbf{(E)}\ \frac23$

Tom has a scientific calculator. Unfortunately, all keys are broken except for one row: 1, 2, 3, + and -. Tom presses a sequence of $5$ random keystrokes; at each stroke, each key is equally likely to be pressed. The calculator then evaluates the entire expression, yielding a result of $E$. Find the expected value of $E$. (Note: Negative numbers are permitted, so 13-22 gives $E = -9$. Any excess operators are parsed as signs, so -2-+3 gives $E=-5$ and -+-31 gives $E = 31$. Trailing operators are discarded, so 2++-+ gives $E=2$. A string consisting only of operators, such as -++-+, gives $E=0$.) [i]Proposed by Lewis Chen[/i]

A coin that comes up heads with probability $ p > 0$ and tails with probability $ 1\minus{}p > 0$ independently on each flip is flipped eight times. Suppose the probability of three heads and five tails is equal to $ \frac{1}{25}$ of the probability of five heads and three tails. Let $ p \equal{} \frac{m}{n}$, where $ m$ and $ n$ are relatively prime positive integers. Find $ m\plus{}n$.

Consider a coin with a head toss probability $p$ where $0 <p <1$ is fixed. Toss the coin several times, the tosses should be independent of each other. Denote by $A_i$ the event that of the $i$-th, $(i + 1)$-th, $\ldots$ , the $(i+m-1)$-th throws, exactly $T$ is the tail. For $T = 1$, calculate the conditional probability $\mathbb{P}(\bar{A_2} \bar{A_3} \cdots \bar{A_m} | A_1)$, and for $T = 2$, prove that $\mathbb{P}(\bar{A_2} \bar{A_3} \cdots \bar{A_m} | A_1)$ has approximation in the form $a+ \tfrac{b}{m} + \mathcal{O}(p^m)$ as $m \to \infty$.

Every phone number in an area consists of eight digits and starts with digit $ 8$. Mr Edy, who has just moved to the area, apply for a new phone number. What is the chance that Mr Edy gets a phone number which consists of at most five different digits?

Suppose 2012 reals are selected independently and at random from the unit interval $[0,1]$, and then written in nondecreasing order as $x_1\le x_2\le\cdots\le x_{2012}$. If the probability that $x_{i+1} - x_i \le \frac{1}{2011}$ for $i=1,2,\ldots,2011$ can be expressed in the form $\frac{m}{n}$ for relatively prime positive integers $m,n$, find the remainder when $m+n$ is divided by 1000. [i]Victor Wang.[/i]

Alan, Barb, Cory, and Doug are on the golf team, Doug, Emma, Fran, and Greg are on the swim team, and Greg, Hope, Inga, and Alan are on the tennis team. These nine people sit in a circle in random order. The probability that no two people from the same team sit next to each other is $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n.$

A fair $6$-sided die is repeatedly rolled until a $1, 4, 5$, or $6$ is rolled. What is the expected value of the product of all the rolls?

Kathryn has a crush on Joe. Dressed as Catwoman, she attends the same school Halloween party as Joe, hoping he will be there. If Joe gets beat up, Kathryn will be able to help Joe, and will be able to tell him how much she likes him. Otherwise, Kathryn will need to get her hipster friend, Max, who is DJing the event, to play Joe’s favorite song, “Pieces of Me” by Ashlee Simpson, to get him out on the dance floor, where she’ll also be able to tell him how much she likes him. Since playing the song would be in flagrant violation of Max’s musical integrity as a DJ, Kathryn will have to bribe him to play the song. For every $\$10$ she gives Max, the probability of him playing the song goes up $10\%$ (from $0\%$ to $10\%$ for the first $\$10$, from $10\%$ to $20\%$ for the next $\$10$, all the way up to $100\%$ if she gives him $\$100$). Max only accepts money in increments of $\$10$. How much money should Kathryn give to Max to give herself at least a $65\%$ chance of securing enough time to tell Joe how much she likes him?

Aumann, Bill, and Charlie each roll a fair $6$-sided die with sides labeled $1$ through $6$ and look at their individual rolls. Each flips a fair coin and, depending on the outcome, looks at the roll of either the player to his right or the player to his left, without anyone else knowing which die he observed. Then, at the same time, each of the three players states the expected value of the sum of the rolls based on the information he has. After hearing what everyone said, the three players again state the expected value of the sum of the rolls based on the information they have. Then, for the third time, after hearing what everyone said, the three players again state the expected value of the sum of the rolls based on the information they have. Prove that Aumann, Bill, and Charlie say the same number the third time.

Let $N>1$ and let $a_1,a_2,\dots,a_N$ be nonnegative reals with sum at most $500$. Prove that there exist integers $k\ge 1$ and $1=n_0<n_1<\dots<n_k=N$ such that \[\sum_{i=1}^k n_ia_{n_{i-1}}<2005.\]

Suppose families always have one, two, or three children, with probability ¼, ½, ¼ respectively. Assuming everyone eventually gets married and has children, what is the probability of a couple having exactly four grandchildren?

A frog makes $ 3$ jumps, each exactly $ 1$ meter long. The directions of the jumps are chosen independently and at random. What is the probability the frog's final position is no more than $ 1$ meter from its starting position? $ \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}$

Each of two boxes contains both black and white marbles, and the total number of marbles in the two boxes is $25.$ One marble is taken out of each box randomly. The probability that both marbles are black is $27/50,$ and the probability that both marbles are white is $m/n,$ where $m$ and $n$ are relatively prime positive integers. What is $m+n?$

In an urn there are one ball marked $1$, two balls marked $2$, and so on, up to $n$ balls marked $n$. Two balls are randomly drawn without replacement. Find the probability that the two balls are assigned the same number.

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

A pair of standard 6-sided fair dice is rolled once. The sum of the numbers rolled determines the diameter of a circle. What is the probability that the numerical value of the area of the circle is less than the numerical value of the circle's circumference? $\textbf{(A)}\,\frac{1}{36} \qquad\textbf{(B)}\,\frac{1}{12} \qquad\textbf{(C)}\,\frac{1}{6} \qquad\textbf{(D)}\,\frac{1}{4} \qquad\textbf{(E)}\,\frac{5}{18}$

Take the square with vertices $(0,0)$, $(1,0)$, $(0,1)$, and $(1,1)$. Choose a random point in this square and draw the line segment from it to $(0,0)$. Choose a second random point in this square and draw the line segment from it to $(1,0)$. What is the probability that the two line segments intersect?

A [i]triangulation[/i] of a polygon is a subdivision of the polygon into triangles meeting edge to edge, with the property that the set of triangle vertices coincides with the set of vertices of the polygon. Adam randomly selects a triangulation of a regular $180$-gon. Then, Bob selects one of the $178$ triangles in this triangulation. The expected number of $1^\circ$ angles in this triangle can be expressed as $\frac{a}{b}$, where $a$ and $b$ are relatively prime positive integers. Compute $100a + b$. [i]Proposed by Lewis Chen[/i]

Star flips a quarter four times. Find the probability that the quarter lands heads exactly twice. $\textbf{(A) }\dfrac18\hspace{14em}\textbf{(B) }\dfrac3{16}\hspace{14em}\textbf{(C) }\dfrac38$ $\textbf{(D) }\dfrac12$

Aileen plays badminton where she and her opponent stand on opposite sides of a net and attempt to bat a birdie back and forth over the net. A player wins a point if their opponent fails to bat the birdie over the net. When Aileen is the server (the first player to try to hit the birdie over the net), she wins a point with probability $\frac{9}{10}$ . Each time Aileen successfully bats the birdie over the net, her opponent, independent of all previous hits, returns the birdie with probability $\frac{3}{4}$ . Each time Aileen bats the birdie, independent of all previous hits, she returns the birdie with probability $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

A small airplane has $4$ rows of seats with $3$ seats in each row. Eight passengers have boarded the plane and are distributed randomly among the seats. A married couple is next to board. What is the probability there will be 2 adjacent seats in the same row for the couple?

Recall that a regular icosahedron is a convex polyhedron having 12 vertices and 20 faces; the faces are congruent equilateral triangles. On each face of a regular icosahedron is written a nonnegative integer such that the sum of all $20$ integers is $39.$ Show that there are two faces that share a vertex and have the same integer written on them.

Jane has two bags $X$ and $Y$. Bag $X$ contains 4 red marbles and 5 blue marbles (and nothing else). Bag $Y$ contains 7 red marbles and 6 blue marbles (and nothing else). Jane will choose one of her bags at random (each bag being equally likely). From her chosen bag, she will then select one of the marbles at random (each marble in that bag being equally likely). What is the probability that she will select a red marble?

On a blackboard lies $50$ magnets in a line numbered from $1$ to $50$, with different magnets containing different numbers. David walks up to the blackboard and rearranges the magnets into some arbitrary order. He then writes underneath each pair of consecutive magnets the positive difference between the numbers on the magnets. If the expected number of times he writes the number $1$ can be written in the form $\tfrac mn$ for relatively prime positive integers $m$ and $n$, compute $100m+n$. [i] Proposed by David Altizio [/i]