A segment $AB$ of length $100$ is divided into $100$ little segments of length $1$ by $99$ intermediate points. Endpoint $A$ is assigned $0$ and endpoint $B$ is assigned $1$. Gustavo assigns each of the $99$ intermediate points a $0$ or a $1$, at his choice, and then color each segment of length $1$ blue or red, respecting the following rule: [i]The segments that have the same number at their ends are red, and the segments that have different numbers at their ends are blue. [/i] Determine if Gustavo can assign the $0$'s and $1$'s so as to get exactly $30$ blue segments. And $35$ blue segments? (In each case, if the answer is yes, show a distribution of $0$'s and $1$'s, and if the answer is no, explain why).

Let $\Omega$ be a family of subsets of $M$ such that: $(\text{i})$ If $|A\cap B|\ge 2$ for $A,B\in\Omega$, then $A=B$; $(\text{ii})$ There exist different subsets $A,B,C\in\Omega$ with $|A\cap B\cap C|=1$; $(\text{iii})$ For every $A\in\Omega$ and $a\in M \ A$, there is a unique $B\in\Omega$ such that $a\in B$ and $A\cap B=\emptyset$. Prove that there are numbers $p$ and $s$ such that: $(1)$ Each $a\in M$ is contained in exactly $p$ sets in $\Omega$; $(2)$ $|A|=s$ for all $A\in\Omega$; $(3)$ $s+1\ge p$.

A right circular cone has base radius 1 cm and slant height 3 cm is given. $P$ is a point on the circumference of the base and the shortest path from $P$ around the cone and back to $P$ is drawn (see diagram). What is the minimum distance from the vertex $V$ to this path? [asy] import graph; unitsize(1 cm); filldraw(shift(-0.15,0.37)*rotate(17)*yscale(0.3)*xscale(1.41)*(Circle((0,0),1)),gray(0.9),nullpen); draw(yscale(0.3)*(arc((0,0),1.5,0,180)),dashed); draw(yscale(0.3)*(arc((0,0),1.5,180,360))); draw((1.5,0)--(0,4)--(-1.5,0)); draw((0,0)--(1.5,0),Arrows); draw(((1.5,0) + (0.3,0.1))--((0,4) + (0.3,0.1)),Arrows); draw(shift(-0.15,0.37)*rotate(17)*yscale(0.3)*xscale(1.41)*(arc((0,0),1,0,180)),dashed); draw(shift(-0.15,0.37)*rotate(17)*yscale(0.3)*xscale(1.41)*(arc((0,0),1,180,360))); label("$V$", (0,4), N); label("1 cm", (0.75,-0.5), N); label("$P$", (-1.5,0), SW); label("3 cm", (1.7,2)); [/asy]

Let $ABCD$ be a rectangle, $AB = a, BC = b$. Consider the family of parallel and equidistant straight lines (the distance between two consecutive lines being $d$) that are at an the angle $\phi, 0 \leq \phi \leq 90^{\circ},$ with respect to $AB$. Let $L$ be the sum of the lengths of all the segments intersecting the rectangle. Find: [i](a)[/i] how $L $ varies, [i](b)[/i] a necessary and sufficient condition for $L$ to be a constant, and [i](c)[/i] the value of this constant.

Prove that the number $\binom np-\left\lfloor\frac np\right\rfloor$ is divisible by $p$ for every prime number and integer $n\ge p$.

Any positive integer $n$ can be written in the form $n = 2^b(2c+1)$. We call $2c+1$ the[i] odd part[/i] of $n$. Given an odd integer $n > 0$, define the sequence $ a_0, a_1, a_2, ...$ as follows: $a_0 = 2^n-1, a_{k+1} $ is the [i]odd part[/i] of $3a_k+1$. Find $a_n$.

Determine all real numbers $a,b,c,d$ that satisfy the following equations \[\begin{cases} abc + ab + bc + ca + a + b + c = 1\\ bcd + bc + cd + db + b + c + d = 9\\ cda + cd + da + ac + c + d + a = 9\\ dab + da + ab + bd + d + a + b = 9\end{cases}\]

In a group of people, every two of them have exactly one mutual friend in the group. Prove that there is one person who is friends with all the other people in the group. Note: the friendship is mutual, that is, if $X$ is friends with $Y$, then $Y$ is friends with $X$.

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]

Solve in prime numbers the equation $x^y - y^x = xy^2 - 19$.

$n$ cockroaches are sitting on the plane at the vertices of the regular $ n $ -gon. They simultaneously begin to move at a speed of $ v $ on the sides of the polygon in the direction of the clockwise adjacent cockroach, then they continue moving in the initial direction with the initial speed. Vasya a entomologist moves on a straight line in the plane at a speed of $u$. After some time, it turned out that Vasya has crushed three cockroaches. Prove that $ v = u $.

Two circles $\mathcal{C}_1$ and $\mathcal{C}_2$ intersect each other at two distinct points $M$ and $N$. A common tangent lines touches $\mathcal{C}_1$ at $P$ and $\mathcal{C}_2$ at $Q$, the line being closer to $N$ than to $M$. The line $PN$ meets the circle $\mathcal{C}_2$ again at the point $R$. Prove that the line $MQ$ is a bisector of the angle $\angle{PMR}$.

We color some points in the plane with red, in such way that if $P,Q$ are red and $X$ is a point such that triangle $\triangle PQX$ has angles $30º, 60º, 90º$ in some order, then $X$ is also red. If we have vertices $A, B, C$ all red, prove that the barycenter of triangle $\triangle ABC$ is also red.

A regular $100$-gon was cut into several parallelograms and two triangles. Prove that these triangles are congruent.

Find all positive integers $n$ so that both $n$ and $n + 100$ have odd numbers of divisors.

Let $ ABC$ be a triangle the lengths of whose sides $ BC,CA,AB,$ respectively, are denoted by $ a,b,$ and $ c$. Let the internal bisectors of the angles $ \angle BAC, \angle ABC, \angle BCA,$ respectively, meet the sides $ BC,CA,$ and $ AB$ at $ D,E,$ and $ F$. Denote the lengths of the line segments $ AD,BE,CF$ by $ d,e,$ and $ f$, respectively. Prove that: $ def\equal{}\frac{4abc(a\plus{}b\plus{}c) \Delta}{(a\plus{}b)(b\plus{}c)(c\plus{}a)}$ where $ \Delta$ stands for the area of the triangle $ ABC$.

Let $ A$ be a unitary finite ring with $ n$ elements, such that the equation $ x^n\equal{}1$ has a unique solution in $ A$, $ x\equal{}1$. Prove that a) $ 0$ is the only nilpotent element of $ A$; b) there exists an integer $ k\geq 2$, such that the equation $ x^k\equal{}x$ has $ n$ solutions in $ A$.

Let $n \in \mathbb N$ and $A_n$ set of all permutations $(a_1, \ldots, a_n)$ of the set $\{1, 2, \ldots , n\}$ for which \[k|2(a_1 + \cdots+ a_k), \text{ for all } 1 \leq k \leq n.\] Find the number of elements of the set $A_n$. [i]Proposed by Vidan Govedarica, Serbia[/i]

Find all $k>0$ for which a strictly decreasing function $g:(0;+\infty)\to(0;+\infty)$ exists such that $g(x)\geq kg(x+g(x))$ for all positive $x$.

A deck consists of $2^n$ cards. The deck is shuffled using the following operation: if the cards are initially in the order $a_1,a_2,a_3,a_4,...,a_{2^n-1},a_{2^n}$ then after shuffling the order becomes $a_{2^{n-1}+1},a_1,a_{2^{n-1}+2},a_2,...,a_{2^n},a_{2^{n-1}}$ . Find the smallest number of such operations after which the original order of the cards is restored. (R. Palm)

Let $n\geq 2$ be an even integer. Find the greatest integer $m\geq 2^{n-2}+1$ such that there exist $m$ distinct subsets of $\{1,2,\dots ,n\}$, any $2^{n-2}+1$ of them having empty intersection. [i]Cristi Săvescu[/i]

Find all couples of non-zero integers $(x,y)$ such that, $x^2+y^2$ is a common divisor of $x^5+y$ and $y^5+x$.

On the computer screen there are initially two $1$'s written. The [i] insert [/i] program causes the sum of those numbers to be inserted between each pair of numbers by pressing the $Enter$ key. In the first step a number is inserted and we obtain $1-2-1$; In the second step two numbers are inserted and we have $1-3-2-3-1$; In the third, four numbers are inserted and you have $1-4-3-5-2-5-3-4-1$; etc Find the sum of all the numbers that appear on the screen at the end of step number $25$.

Let $ABC$ be an acute triangle such that $AB>BC>AC$. Let $D$ be a point different from $C$ on the segment $BC$, such that $AC=AD$. Let $H$ be the orthocenter of triangle $ABC$ and let $A_1$ and $B_1$ be the intersections of the heights from $A$ and $B$ to the opposite sides, respectively. Let $E$ be the intersection of the lines $A_1B_1$ and $DH$. Prove that $B$, $D$, $B_1$, $E$ are concyclic.

On the board are written $2 , 3 , 5 ,... , 2003$ , that is, all the prime numbers of the interval $[2,2007]$ . The operation of [i]simplification [/i] is the replacement of two numbers $a , b$ by a maximal prime number not exceeding $\sqrt{a^2-a b+b^2}$ . First, the student erases the number $q, 2<q<2003$, then applies the [i]simplification [/i] operation to the remaining numbers until one number remains. Find the maximum possible and minimum possible values of the number obtained in the end. How do these values depend on the number $q$?