There are 81 grid points (uniformly spaced) in the square shown in the diagram below, including the points on the edges. Point $P$ is the center of the square. Given that point $Q$ is randomly chosen from among the other 80 points, what is the probability that line $PQ$ is a line of symmetry for the square? [asy] size(130); defaultpen(fontsize(11)); int i, j; for(i=0; i<9; i=i+1) { for(j=0; j<9; j=j+1) if((i==4) && (j==4)) { dot((i,j),linewidth(5)); } else { dot((i,j),linewidth(3)); } } dot("$P$",(4,4),NE); draw((0,0)--(0,8)--(8,8)--(8,0)--cycle); [/asy] $\textbf{(A) } \frac{1}{5} \qquad\textbf{(B) } \frac{1}{4} \qquad\textbf{(C) } \frac{2}{5} \qquad\textbf{(D) } \frac{9}{20} \qquad\textbf{(E) } \frac{1}{2}$

Two people throw coins. One throws his coin $10$ times, the other throws his $11$ times . What is the probability that the second coin fell showing "heads" a greater number of times than the first? (For those not familiar with Probability Theory this question could have been reformulated thus : Consider various arrangements of a $21$ digit number in which each digit must be a " $1$ " or a "$2$" . Among all such numbers what fraction of them will have more occurrences of the digit "$2$" among the last $11$ digits than among the first $10$?) (S. Fomin , Leningrad)

[i]Nyihaha[/i] and [i]Bruhaha[/i] are two neighbouring islands, both having $n$ inhabitants. On island [i]Nyihaha[/i] every inhabitant is either a Knight or a Knave. Knights always tell the truth and Knaves always lie. The inhabitants of island [i]Bruhaha[/i] are normal people, who can choose to tell the truth or lie. When a visitor arrives on any of the two islands, the following ritual is performed: every inhabitant points randomly to another inhabitant (indepently from each other with uniform distribution), and tells "He is a Knight" or "He is a Knave'". On sland [i]Nyihaha[/i], Knights have to tell the truth and Knaves have to lie. On island [i]Bruhaha[/i] every inhabitant tells the truth with probability $1/2$ independently from each other. Sinbad arrives on island [i]Bruhaha[/i], but he does not know whether he is on island [i]Nyihaha[/i] or island [i]Bruhaha[/i]. Let $p_n$ denote the probability that after observing the ritual he can rule out being on island [i]Nyihaha[/i]. Is it true that $p_n\to 1$ if $n\to\infty$? [i]Proposed by Dávid Matolcsi, Berkeley[/i]

Let $\xi_1 , \xi_2 , ...$ be a series of independent, zero-expected-value random variables for which $\lim_{n\to\infty} E(\xi_n ^ 2) = 0$, and $S_n = \sum_{j = 1}^n \xi_j$ . Denote by I(A) the indicator function of event A. Prove that $$\frac{1}{\log n} \sum_{k = 1}^n \frac1k I\bigg(\max_{1\leq j\leq k} |S_j|>\sqrt k\bigg) \to 0$$ with probability 1 if $n\to\infty$ .

A point $ P$ is chosen at random in the interior of a unit square $ S$. Let $ d(P)$ denote the distance from $ P$ to the closest side of $ S$. The probability that $ \frac15\le d(P)\le\frac13$ is equal to $ \frac{m}{n}$, where $ m$ and $ n$ are relatively prime positive integers. Find $ m\plus{}n$.

What is the probability of having no $B$ before the first $A$ in a random permutation of the word $\text{ABRAKADABRA}$? $ \textbf{(A)}\ \dfrac 23 \qquad\textbf{(B)}\ \dfrac 57 \qquad\textbf{(C)}\ \dfrac 56 \qquad\textbf{(D)}\ \dfrac 67 \qquad\textbf{(E)}\ \text{None of the preceding} $

In the array of $13$ squares shown below, $8$ squares are colored red, and the remaining $5$ squares are colored blue. If one of all possible such colorings is chosen at random, the probability that the chosen colored array appears the same when rotated $90^{\circ}$ around the central square is $\tfrac{1}{n}$, where $n$ is a positive integer. Find $n$. [asy] draw((0,0)--(1,0)--(1,1)--(0,1)--(0,0)); draw((2,0)--(2,2)--(3,2)--(3,0)--(3,1)--(2,1)--(4,1)--(4,0)--(2,0)); draw((1,2)--(1,4)--(0,4)--(0,2)--(0,3)--(1,3)--(-1,3)--(-1,2)--(1,2)); draw((-1,1)--(-3,1)--(-3,0)--(-1,0)--(-2,0)--(-2,1)--(-2,-1)--(-1,-1)--(-1,1)); draw((0,-1)--(0,-3)--(1,-3)--(1,-1)--(1,-2)--(0,-2)--(2,-2)--(2,-1)--(0,-1)); size(100); [/asy]

Three numbers are chosen independently at random, one from each of the three intervals $[0, L_i ]$ ($i=1,2,3$). If the distribution of each random number is uniform with respect to the length of the interval it is chosen from, determine the expected value of the smallest number chosen.

An urn contains one red ball and one blue ball. A box of extra red and blue balls lie nearby. George performs the following operation four times: he draws a ball from the urn at random and then takes a ball of the same color from the box and returns those two matching balls to the urn. After the four iterations the urn contains six balls. What is the probability that the urn contains three balls of each color? $\textbf{(A) } \frac16 \qquad \textbf{(B) }\frac15 \qquad \textbf{(C) } \frac14 \qquad \textbf{(D) } \frac13 \qquad \textbf{(E) } \frac12$

A girl and a guy are going to arrive at a train station. If they arrive within 10 minutes of each other, they will instantly fall in love and live happily ever after. But after 10 minutes, whichever one arrives first will fall asleep and they will be forever alone. The girl will arrive between 8 AM and 9 AM with equal probability. The guy will arrive between 7 AM and 8:30 AM, also with equal probability. Let $\frac pq$ for $p$, $q$ coprime be the probability that they fall in love. Find $p + q$.

Four distinct points, $A$, $B$, $C$, and $D$, are to be selected from $1996$ points evenly spaced around a circle. All quadruples are equally likely to be chosen. What is the probability that the chord $AB$ intersects the chord $CD$? $\text{(A)}\ \frac 14 \qquad \text{(B)}\ \frac 13 \qquad \text{(C)}\ \frac 12 \qquad \text{(D)}\ \frac 23\qquad \text{(E)}\ \frac 34$

The probability that a set of three distinct vertices chosen at random from among the vertices of a regular $n$-gon determine an obtuse triangle is $\tfrac{93}{125}$. Find the sum of all possible values of $n$.

An urn contains $4$ green balls and $6$ blue balls. A second urn contains $16$ green balls and $N$ blue balls. A single ball is drawn at random from each urn. The probability that both balls are of the same color is $0.58$. Find $N$.

We would like to give a present to one of $100$ children. We do this by throwing a biased coin $k$ times, after predetermining who wins in each possible outcome of this lottery. Prove that we can choose the probability $p$ of throwing heads, and the value of $k$ such that, by distributing the $2^k$ different outcomes between the children in the right way, we can guarantee that each child has the same probability of winning.

Dave rolls a fair six-sided die until a six appears for the first time. Independently, Linda rolls a fair six-sided die until a six appears for the first time. Let $ m$ and $ n$ be relatively prime positive integers such that $ \frac{m}{n}$ is the probability that the number of times Dave rolls his die is equal to or within one of the number of times Linda rolls her die. Find $ m\plus{}n$.

Seven teams play a soccer tournament in which each team plays every other team exactly once. No ties occur, each team has a $50\%$ chance of winning each game it plays, and the outcomes of the games are independent. In each game, the winner is awarded a point and the loser gets 0 points. The total points are accumilated to decide the ranks of the teams. In the first game of the tournament, team $A$ beats team $B$. The probability that team $A$ finishes with more points than team $B$ is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

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?

a) There is an infinite sequence of $0,1$, like $\dots,a_{-1},a_{0},a_{1},\dots$ (i.e. an element of $\{0,1\}^{\mathbb Z}$). At each step we make a new sequence. There is a function $f$ such that for each $i$, $\mbox{new }a_{i}=f(a_{i-100},a_{i-99},\dots,a_{i+100})$. This operation is mapping $F: \{0,1\}^{\mathbb Z}\longrightarrow\{0,1\}^{\mathbb Z}$. Prove that if $F$ is 1-1, then it is surjective. b) Is the statement correct if we have an $f_{i}$ for each $i$?

Given positive integers $m$ and $n$, prove that there is a positive integer $c$ such that the numbers $cm$ and $cn$ have the same number of occurrences of each non-zero digit when written in base ten.

An unfair coin has probability $p$ of coming up heads on a single toss. Let $w$ be the probability that, in $5$ independent toss of this coin, heads come up exactly $3$ times. If $w = 144 / 625$, then $ \textbf{(A)}\ p\text{ must be }2/5$ $ \textbf{(B)}\ p\text{ must be }3/5$ $ \textbf{(C)}\ p\text{ must be greater than }3/5$ $ \textbf{(D)}\ p\text{ is not uniquely determined}$ $ \textbf{(E)}\ \text{there is no value of }p\text{ for which }w = 144/625$

Suppose that $X\sim\operatorname{Uniform}(0,1)$ and $Y\sim\operatorname{Bernoulli}\left(\frac14\right)$, independently of each other. Let $Z=X+Y$. Then which of the following is true? $\textbf{(A)}~\text{The distribution of }Z\text{ is symmetric about }1$ $\textbf{(B)}~Z\text{ has a probability density function}$ $\textbf{(C)}~E(Z)=\frac54$ $\textbf{(D)}~P(Z\le1)=\frac14$

Four points are chosen uniformly and independently at random in the interior of a given circle. Find the probability that they are the vertices of a convex quadrilateral.

A game about passing barriers rules that in the $n$th barrier, you need to throw a dice for $n$ times. If the sum of points you get is larger than $2^n$, then you can pass this barrier. [b](a)[/b] How many barriers can you pass at most? [b](b)[/b] Find the probablity of passing the first three barriers.

We play a game. The pot starts at $\$0$. On every turn, you flip a fair coin. If you flip heads, I add $\$100$ to the pot. If you flip tails, I take all of the money out of the pot, and you are assessed a "strike". You can stop the game before any flip and collect the contents of the pot, but if you get 3 strikes, the game is over and you win nothing. Find, with proof, the expected value of your winnings if you follow an optimal strategy.

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