Nine tiles are numbered $1, 2, 3, \ldots, 9,$ respectively. Each of three players randomly selects and keeps three of the tile, and sums those three values. The probability that all three players obtain an odd sum is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

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

There are $n$ distinct points on a circumference. Choose one of the points. Connect this point and the $m$th point from the chosen point counterclockwise with a segment. Connect this $m$th point and the $m$th point from this $m$th point counterclockwise with a segment. Repeat such steps until no new segment is constructed. From the intersections of the segments, let the number of the intersections - which are in the circle - be $I$. Answer the following questions ($m$ and $n$ are positive integers that are relatively prime and they satisfy $6 \leq 2m < n$). 1) When the $n$ points take different positions, express the maximum value of $I$ in terms of $m$ and $n$. 2) Prove that $I \geq n$. Prove that there is a case, which is $I=n$, when $m=3$ and $n$ is arbitrary even number that satisfies the condition.

Let $p$ be the probability that, in the process of repeatedly flipping a fair coin, one will encounter a run of 5 heads before one encounters a run of 2 tails. Given that $p$ can be written in the form $m/n$ where $m$ and $n$ are relatively prime positive integers, find $m+n$.

Forty teams play a tournament in which every team plays every other team exactly once. No ties occur, and each team has a $50 \%$ chance of winning any game it plays. The probability that no two teams win the same number of games is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $\log_2 n.$

A capricious mathematician writes a book with pages numbered from $2$ to $400$. The pages are to be read in the following order. Take the last unread page ($400$), then read (in the usual order) all pages which are not relatively prime to it and which have not been read before. Repeat until all pages are read. So, the order would be $2, 4, 5, ... , 400, 3, 7, 9, ... , 399, ...$. What is the last page to be read?

let $x_1$, $x_2$ .... $x_6$ be non-negative reals such that $x_1+x_2+x_3+x_4+x_5+x_6=1$ and $x_1x_3x_5$ + $x_2x_4x_6$ $\geq$ $\frac{1}{540}$. Let $p$ and $q$ be relatively prime integers such that $\frac{p}{q}$ is the maximum value of $x_1x_2x_3+x_2x_3x_4+x_3x_4x_5+x_4x_5x_6+x_5x_6x_1+x_6x_1x_2$. Find $p+q$

In the expansion of $(ax+b)^{2000},$ where $a$ and $b$ are relatively prime positive integers, the coefficients of $x^{2}$ and $x^{3}$ are equal. Find $a+b.$

Let $ \mathcal{R}$ be the region consisting of the set of points in the coordinate plane that satisfy both $ |8 \minus{} x| \plus{} y \le 10$ and $ 3y \minus{} x \ge 15$. When $ \mathcal{R}$ is revolved around the line whose equation is $ 3y \minus{} x \equal{} 15$, the volume of the resulting solid is $ \frac {m\pi}{n\sqrt {p}}$, where $ m$, $ n$, and $ p$ are positive integers, $ m$ and $ n$ are relatively prime, and $ p$ is not divisible by the square of any prime. Find $ m \plus{} n \plus{} p$.

If $n$ is a natural number, prove that the number $(n+1)(n+2)\cdots(n+10)$ is not a perfect square.

The diagram shows a rectangle that has been dissected into nine non-overlapping squares. Given that the width and the height of the rectangle are relatively prime positive integers, find the perimeter of the rectangle. [asy] defaultpen(linewidth(0.7)); draw((0,0)--(69,0)--(69,61)--(0,61)--(0,0));draw((36,0)--(36,36)--(0,36)); draw((36,33)--(69,33));draw((41,33)--(41,61));draw((25,36)--(25,61)); draw((34,36)--(34,45)--(25,45)); draw((36,36)--(36,38)--(34,38)); draw((36,38)--(41,38)); draw((34,45)--(41,45));[/asy]

For every positive integer $ n$, $ b(n)$ denote the number of positive divisors of $ n$ and $ p(n)$ denote the sum of all positive divisors of $ n$. For example, $ b(14)\equal{}4$ and $ p(14)\equal{}24$. Let $ k$ be a positive integer greater than $ 1$. (a) Prove that there are infinitely many positive integers $ n$ which satisfy $ b(n)\equal{}k^2\minus{}k\plus{}1$. (b) Prove that there are finitely many positive integers $ n$ which satisfy $ p(n)\equal{}k^2\minus{}k\plus{}1$.

$ABCD$ is a rectangular sheet of paper that has been folded so that corner $B$ is matched with point $B'$ on edge $AD$. The crease is $EF$, where $E$ is on $AB$ and $F$is on $CD$. The dimensions $AE=8$, $BE=17$, and $CF=3$ are given. The perimeter of rectangle $ABCD$ is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [asy] size(200); defaultpen(linewidth(0.7)+fontsize(10)); pair A=origin, B=(25,0), C=(25,70/3), D=(0,70/3), E=(8,0), F=(22,70/3), Bp=reflect(E,F)*B, Cp=reflect(E,F)*C; draw(F--D--A--E); draw(E--B--C--F, linetype("4 4")); filldraw(E--F--Cp--Bp--cycle, white, black); pair point=( 12.5, 35/3 ); label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); label("$E$", E, dir(point--E)); label("$F$", F, dir(point--F)); label("$B^\prime$", Bp, dir(point--Bp)); label("$C^\prime$", Cp, dir(point--Cp));[/asy]

A positive integer $n$ between $1$ and $N=2007^{2007}$ inclusive is selected at random. If $a$ and $b$ are natural numbers such that $a/b$ is the probability that $N$ and $n^3-36n$ are relatively prime, find the value of $a+b$.

Each side of an arbitrarly triangle is divided into $ 2002$ congruent segments. After that, each vertex is joined with all "division" points on the opposite side. Prove that the number of the regions formed, in which the triangle is divided, is divisible by $ 6$. [i]Proposer[/i]: [b]Dorian Croitoru[/b]