Alberto wants to organize a poker game with his friends this evening. Bruno and Barbara together go to gym once in three evenings, whereas Carla, Corrado, Dario and Davide are busy once in two evenings (not necessarily the same day). Moreover, Dario is not willing to play with Davide, since they have a quarrel over a girl. A poker game requires at least four persons (including Alberto). What is the probability that the game will be played?

Galatasaray and Fenerbahce have qualified last $16$ in the Europen Champions League. Aftar a random draw, eight matches are regulated in that knock-out phase. The winners of the eight matches will qualify for the next round - round of $8$. Knock-out phase continues until one team remains. If each team has equal chance to win, what is the propability of having a Galatasaray-Fenerbahce match? $ \textbf{(A)}\ \dfrac {1}{32} \qquad\textbf{(B)}\ \dfrac {1}{16} \qquad\textbf{(C)}\ \dfrac {1}{8} \qquad\textbf{(D)}\ \dfrac {1}{4} \qquad\textbf{(E)}\ \text{None of the preceding} $

The numbers $1,2,\dots,9$ are randomly placed into the $9$ squares of a $3 \times 3$ grid. Each square gets one number, and each of the numbers is used once. What is the probability that the sum of the numbers in each row and each column is odd? $\textbf{(A) }1/21\qquad\textbf{(B) }1/14\qquad\textbf{(C) }5/63\qquad\textbf{(D) }2/21\qquad\textbf{(E) } 1/7$

An insurance company believes that people can be divided into 2 classes: those who are accident prone and those who are not. Their statistics show that an accident prone person will have an accident in a yearly period with probability 0.4, whereas this probability is 0.2 for the other kind. Given that 30% of people are accident prone, what is the probability that a new policyholder will have an accident within a year of purchasing a policy?

We are given the finite sets $ X$, $ A_1$, $ A_2$, $ \dots$, $ A_{n \minus{} 1}$ and the functions $ f_i: \ X\rightarrow A_i$. A vector $ (x_1,x_2,\dots,x_n)\in X^n$ is called [i]nice[/i], if $ f_i(x_i) \equal{} f_i(x_{i \plus{} 1})$, for each $ i \equal{} 1,2,\dots,n \minus{} 1$. Prove that the number of nice vectors is at least \[ \frac {|X|^n}{\prod\limits_{i \equal{} 1}^{n \minus{} 1} |A_i|}. \]

For $p_0,\dots,p_d\in\mathbb{R}^d$, let \[ S(p_0,\dots,p_d)=\left\{ \alpha_0p_0+\dots+\alpha_dp_d : \alpha_i\le 1, \sum_{i=0}^d \alpha_i =1 \right\}. \] Let $\pi$ be an arbitrary probability distribution on $\mathbb{R}^d$, and choose $p_0,\dots,p_d$ independently with distribution $\pi$. Prove that the expectation of $\pi(S(p_0,\dots,p_d))$ is at least $1/(d+2)$.

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?

Eight people are sitting around a circular table, each holding a fair coin. All eight people flip their coins and those who flip heads stand while those who flip tails remain seated. What is the probability that no two adjacent people will stand? $\textbf{(A) }\dfrac{47}{256}\qquad\textbf{(B) }\dfrac{3}{16}\qquad\textbf{(C) }\dfrac{49}{256}\qquad\textbf{(D) }\dfrac{25}{128}\qquad\textbf{(E) }\dfrac{51}{256}$

We consider the following game for one person. The aim of the player is to reach a fixed capital $C>2$. The player begins with capital $0<x_0<C$. In each turn let $x$ be the player’s current capital. Define $s(x)$ as follows: $$s(x):=\begin{cases}x&\text{if }x<1\\C-x&\text{if }C-x<1\\1&\text{otherwise.}\end{cases}$$Then a fair coin is tossed and the player’s capital either increases or decreases by $s(x)$, each with probability $\frac12$. Find the probability that in a finite number of turns the player wins by reaching the capital $C$.

Rational numbers $a$ and $b$ are chosen at random among all rational numbers in the interval $[0,2)$ that can be written as fractions $\tfrac nd$ where $n$ and $d$ are integers with $1\leq d\leq 5$. What is the probability that \[(\cos(a\pi)+i\sin(b\pi))^4\] is a real number? $\textbf{(A) }\dfrac3{50}\qquad\textbf{(B) }\dfrac4{25}\qquad\textbf{(C) }\dfrac{41}{200}\qquad\textbf{(D) }\dfrac6{25}\qquad\textbf{(E) }\dfrac{13}{50}$

A Sudoku matrix is defined as a $ 9\times9$ array with entries from $ \{1, 2, \ldots , 9\}$ and with the constraint that each row, each column, and each of the nine $ 3 \times 3$ boxes that tile the array contains each digit from $ 1$ to $ 9$ exactly once. A Sudoku matrix is chosen at random (so that every Sudoku matrix has equal probability of being chosen). We know two of the squares in this matrix, as shown. What is the probability that the square marked by ? contains the digit $ 3$? $ \setlength{\unitlength}{6mm} \begin{picture}(9,9)(0,0) \multiput(0,0)(1,0){10}{\line(0,1){9}} \multiput(0,0)(0,1){10}{\line(1,0){9}} \linethickness{1.2pt} \multiput(0,0)(3,0){4}{\line(0,1){9}} \multiput(0,0)(0,3){4}{\line(1,0){9}} \put(0,8){\makebox(1,1){1}} \put(1,7){\makebox(1,1){2}} \put(3,6){\makebox(1,1){?}} \end{picture}$

A supermarket has $128$ crates of apples. Each crate contains at least $120$ apples and at most $144$ apples. What is the largest integer $n$ such that there must be at least $n$ crates containing the same number of apples? $\textbf{(A) }4\qquad\textbf{(B) }5\qquad\textbf{(C) }6\qquad\textbf{(D) }24\qquad \textbf{(E) }25$

A particle performing a random walk on the integer points of the semi-axis $x \ge 0$ moves a distance $1$ to the right with probability $a$, and to the left with probability $b$, and stands still in the remaining cases (if $x = 0$, it stands still instead of moving to the left). Determine the steady-state probability distribution, and also the expectation of $x$ and $x^2$ over a long time, if the particle starts at the point $0$.

Among $100$ points in the plane, no three collinear, exactly $4026$ pairs are connected by line segments. Each point is then randomly assigned an integer from $1$ to $100$ inclusive, each equally likely, such that no integer appears more than once. Find the expected value of the number of segments which join two points whose labels differ by at least $50$. [i]Proposed by Evan Chen[/i]

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.

Morteza and Amir Reza play the following game. First each of them independently roll a dice $100$ times in a row to construct a $100$-digit number with digits $1,2,3,4,5,6$ then they simultaneously shout a number from $1$ to $100$ and write down the corresponding digit to the number other person shouted in their $100$ digit number. If both of the players write down $6$ they both win otherwise they both loose. Do they have a strategy with wining chance more than $\frac{1}{36}$? [i]Proposed by Morteza Saghafian[/i]

Ten identical crates each of dimensions $ 3$ ft $ \times$ $ 4$ ft $ \times$ $ 6$ ft. The first crate is placed flat on the floor. Each of the remaining nine crates is placed, in turn, flat on top of the previous crate, and the orientation of each crate is chosen at random. Let $ \frac{m}{n}$ be the probability that the stack of crates is exactly $ 41$ ft tall, where $ m$ and $ n$ are relatively prime positive integers. Find $ m$.

Each of 2010 boxes in a line contains a single red marble, and for $ 1 \le k \le 2010$, the box in the $ kth$ position also contains $ k$ white marbles. Isabella begins at the first box and successively draws a single marble at random from each box, in order. She stops when she first draws a red marble. Let $ P(n)$ be the probability that Isabella stops after drawing exactly $ n$ marbles. What is the smallest value of $ n$ for which $ P(n) < \frac {1}{2010}$? $ \textbf{(A)}\ 45 \qquad \textbf{(B)}\ 63 \qquad \textbf{(C)}\ 64 \qquad \textbf{(D)}\ 201 \qquad \textbf{(E)}\ 1005$

(a) Alenka has two jars, each with $6$ marbles labeled with numbers $1$ through $6$. She draws one marble from each jar at random. Denote by $p_n$ the probability that the sum of the labels of the two drawn marbles is $n$. Compute pn for each $n \in N$. (b) Barbara has two jars, each with $6$ marbles which are labeled with unknown numbers. The sets of labels in the two jars may differ and two marbles in the same jar can have the same label. If she draws one marble from each jar at random, the probability that the sum of the labels of the drawn marbles is $n$ equals the probability $p_n$ in Alenka’s case. Determine the labels of the marbles. Find all solution

Do there exist such a triangle $T$, that for any coloring of a plane in two colors one may found a triangle $T'$, equal to $T$, such that all vertices of $T'$ have the same color. [b] proposed by S. Berlov[/b]

In a game, there are three indistinguishable boxes; one box contains two red balls, one contains two blue balls, and the last contains one ball of each color. To play, Raj first predicts whether he will draw two balls of the same color or two of different colors. Then, he picks a box, draws a ball at random, looks at the color, and replaces the ball in the same box. Finally, he repeats this; however, the boxes are not shuffled between draws, so he can determine whether he wants to draw again from the same box. Raj wins if he predicts correctly; if he plays optimally, what is the probability that he will win?

A regular pentagon is drawn in the plane, along with all its diagonals. All its sides and diagonals are extended infinitely in both directions, dividing the plane into regions, some of which are unbounded. An ant starts in the center of the pentagon, and every second, the ant randomly chooses one of the edges of the region it's in, with an equal probability of choosing each edge, and crosses that edge into another region. If the ant enters an unbounded region, it explodes. After first leaving the central region of the pentagon, let $x$ be the expected number of times the ant re-enters the central region before it explodes. Find the closest integer to $100x$.

On a given circle, six points $A$, $B$, $C$, $D$, $E$, and $F$ are chosen at random, independently and uniformly with respect to arc length. Determine the probability that the two triangles $ABC$ and $DEF$ are disjoint, i.e., have no common points.

Many states use a sequence of three letters followed by a sequence of three digits as their standard license-plate pattern. Given that each three-letter three-digit arrangement is equally likely, the probability that such a license plate will contain at least one palindrome (a three-letter arrangement or a three-digit arrangement that reads the same left-to-right as it does right-to-left) is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Each time you click a toggle switch, the switch either turns from [i]off[/i] to [i]on[/i] or from [i]on[/i] to [i]off[/i]. Suppose that you start with three toggle switches with one of them [i]on[/i] and two of them [i]off[/i]. On each move you randomly select one of the three switches and click it. Let $m$ and $n$ be relatively prime positive integers so that $\frac{m}{n}$ is the probability that after four such clicks, one switch will be [i]on[/i] and two of them will be [i]off[/i]. Find $m+n$.