Suppose we have a simple polygon (that is it does not intersect itself, but not necessarily convex). Show that this polygon has a diameter which is completely inside the polygon and the two arcs it creates on the polygon perimeter (the two arcs have 2 vertices in common) both have at least one third of the vertices of the polygon.

Let $G$ be a tournoment such that it's edges are colored either red or blue. Prove that there exists a vertex of $G$ like $v$ with the property that, for every other vertex $u$ there is a mono-color directed path from $v$ to $u$.

Let $\{a_n\}_{n\geq 1}$ be a sequence of real numbers which satisfies the following relation: \[a_{n+1}=10^n a_n^2\] (a) Prove that if $a_1$ is small enough, then $\displaystyle\lim_{n\to\infty} a_n =0$. (b) Find all possible values of $a_1\in \mathbb{R}$, $a_1\geq 0$, such that $\displaystyle\lim_{n\to\infty} a_n =0$.

Let us consider a simle graph with vertex set $ V$. All ordered pair $ (a,b)$ of integers with $ gcd(a,b) \equal{} 1$, are elements of V. $ (a,b)$ is connected to $ (a,b \plus{} kab)$ by an edge and to $ (a \plus{} kab,b)$ by another edge for all integer k. Prove that for all $ (a,b)\in V$, there exists a path fromm $ (1,1)$ to $ (a,b)$.

Prove that if a person a has infinitely many descendants (children, their children, etc.), then a has an infinite sequence $a_0, a_1, \ldots$ of descendants (i.e., $a = a_0$ and for all $n \geq 1, a_{n+1}$ is always a child of $a_n$). It is assumed that no-one can have infinitely many children. [i]Variant 1[/i]. Prove that if $a$ has infinitely many ancestors, then $a$ has an infinite descending sequence of ancestors (i.e., $a_0, a_1, \ldots$ where $a = a_0$ and $a_n$ is always a child of $a_{n+1}$). [i]Variant 2.[/i] Prove that if someone has infinitely many ancestors, then all people cannot descend from $A(dam)$ and $E(ve)$.

Let $n$ be a positive integer and let $S$ be a set of $2^n+1$ elements. Let $f$ be a function from the set of two-element subsets of $S$ to $\{0, \dots, 2^{n-1}-1\}$. Assume that for any elements $x, y, z$ of $S$, one of $f(\{x,y\}), f(\{y,z\}), f(\{z, x\})$ is equal to the sum of the other two. Show that there exist $a, b, c$ in $S$ such that $f(\{a,b\}), f(\{b,c\}), f(\{c,a\})$ are all equal to 0.

Let A be a symmetric matrix such that the sum of elements of any row is zero. Show that all elements in the main diagonal of cofator matrix of A are equal.

The number $1$ is written on the blackboard. After that a sequence of numbers is created as follows: at each step each number $a$ on the blackboard is replaced by the numbers $a - 1$ and $a + 1$; if the number $0$ occurs, it is erased immediately; if a number occurs more than once, all its occurrences are left on the blackboard. Thus the blackboard will show $1$ after $0$ steps; $2$ after $1$ step; $1, 3$ after $2$ steps; $2, 2, 4$ after $3$ steps, and so on. How many numbers will there be on the blackboard after $n$ steps?

Three non-collinear points $A_1, A_2, A_3$ are given in a plane. For $n = 4, 5, 6, \ldots$, $A_n$ be the centroid of the triangle $A_{n-3}A_{n-2}A_{n-1}$. [list] a) Show that there is exactly one point $S$, which lies in the interior of the triangle $A_{n-3}A_{n-2}A_{n-1}$ for all $n\ge 4$. b) Let $T$ be the intersection of the line $A_1A_2$ with $SA_3$. Determine the two ratios, $A_1T : TA_2$ and $TS : SA_3$. [/list]

Denote by $ S$ the set of all positive integers. Find all functions $ f: S \rightarrow S$ such that \[ f (f^2(m) \plus{} 2f^2(n)) \equal{} m^2 \plus{} 2 n^2\] for all $ m,n \in S$. [i]Bulgaria[/i]

Consider $n$ disks $C_{1}; C_{2}; ... ; C_{n}$ in a plane such that for each $1 \leq i < n$, the center of $C_{i}$ is on the circumference of $C_{i+1}$, and the center of $C_{n}$ is on the circumference of $C_{1}$. Define the [i]score[/i] of such an arrangement of $n$ disks to be the number of pairs $(i; j )$ for which $C_{i}$ properly contains $C_{j}$ . Determine the maximum possible score.

For a given real number $a$ and a positive integer $n$, prove that: i) there exists exactly one sequence of real numbers $x_0,x_1,\ldots,x_n,x_{n+1}$ such that \[\begin{cases} x_0=x_{n+1}=0,\\ \frac{1}{2}(x_i+x_{i+1})=x_i+x_i^3-a^3,\ i=1,2,\ldots,n.\end{cases}\] ii) the sequence $x_0,x_1,\ldots,x_n,x_{n+1}$ in i) satisfies $|x_i|\le |a|$ where $i=0,1,\ldots,n+1$. [i]Liang Yengde[/i]

Consider functions $\, f: [0,1] \rightarrow \mathbb{R} \,$ which satisfy (i) $f(x) \geq 0 \,$ for all $\, x \,$ in $\, [0,1],$ (ii) $f(1) = 1,$ (iii) $f(x) + f(y) \leq f(x+y)\,$ whenever $\, x, \, y, \,$ and $\, x + y \,$ are all in $\, [0,1]$. Find, with proof, the smallest constant $\, c \,$ such that \[ f(x) \leq cx \] for every function $\, f \,$ satisfying (i)-(iii) and every $\, x \,$ in $\, [0,1]$.

Consider an infinite strip of unit squares. The squares are numbered "1", "2", "3", ... A pawn starts on one of the squares and it can move according to the following rules: (1) from the square numbered "$n$" to the square numbered "$2n$", and vice versa; (2) from the square numbered "$n$" to the square numbered "$3n + 1$", and vice versa. Show that the pawn can reach the square numbered "$1$" in a finite number of moves.

Palindrome is a sequence of digits which doesn't change if we reverse the order of its digits. Prove that a sequence $(x_n)^{\infty}_{n=0}$ defined as $x_n=2013+317n$ contains infinitely many numbers with their decimal expansions being palindromes.

Suppose that $a_0=1$ and that $a_{n+1}=a_n+e^{-a_n}$ for $n=0,1,2,\dots.$ Does $a_n-\log n$ have a finite limit as $n\to\infty?$ (Here $\log n=\log_en=\ln n.$)

An $n\times n$ chessboard is given, where $n$ is an even positive integer. On every line, the unit squares are to be permuted, subject to the condition that the resulting table has to be symmetric with respect to its main diagonal (the diagonal from the top-left corner to the bottom-right corner). We say that a board is [i]alternative[/i] if it has at least one pair of complementary lines (two lines are complementary if the unit squares on them which lie on the same column have distinct colours). Otherwise, we call the board [i]nonalternative[/i]. For what values of $n$ do we always get from the $n\times n$ chessboard an alternative board?\\ \\ [i](Alexandru Petrescu and Andra Elena Mircea)[/i]

$n$ being a given integer, find all functions $f\colon \mathbb{Z} \to \mathbb{Z}$, such that for all integers $x,y$ we have $f\left( {x + y + f(y)} \right) = f(x) + ny$.

Let $n$ be a positive integer. Determine the size of the largest subset of $\{ -n, -n+1, \dots, n-1, n\}$ which does not contain three elements $a$, $b$, $c$ (not necessarily distinct) satisfying $a+b+c=0$.

Determine all positive integers $n$, $n\ge2$, such that the following statement is true: If $(a_1,a_2,...,a_n)$ is a sequence of positive integers with $a_1+a_2+\cdots+a_n=2n-1$, then there is block of (at least two) consecutive terms in the sequence with their (arithmetic) mean being an integer.

The set $A$ has exactly $n>4$ elements. Ann chooses $n+1$ distinct subsets of $A$, such that every subset has exactly $3$ elements. Prove that there exist two subsets chosen by Ann which have exactly one common element.

Given a convex polyhedron with an even number of edges. Prove that we can attach an arrow to each edge, such that for every vertex of the polyhedron, the number of the arrows ending in this vertex is even.

In a convex $n$-gon, several diagonals are drawn. Among these diagonals, a diagonal is called [i]good[/i] if it intersects exactly one other diagonal drawn (in the interior of the $n$-gon). Find the maximum number of good diagonals.

Find all groups of positive integers $ (a,x,y,n,m)$ that satisfy $ a(x^n \minus{} x^m) \equal{} (ax^m \minus{} 4) y^2$ and $ m \equiv n \pmod{2}$ and $ ax$ is odd.

Two people A and B play a game in the $m \times n$ grid ($m,n \in \mathbb{N^*}$). Each person respectively (A plays first) draw a segment between two point of the grid such that this segment doesn't contain any point (except the 2 ends) and also the segment (except the 2 ends) doesn't intersect with any other segments. The last person who can't draw is the loser. Which one (of A and B) have the winning tactics?