Let $\mathcal{P}$ be a regular polygon, and let $\mathcal{V}$ be its set of vertices. Each point in $\mathcal{V}$ is colored red, white, or blue. A subset of $\mathcal{V}$ is [i]patriotic[/i] if it contains an equal number of points of each color, and a side of $\mathcal{P}$ is [i]dazzling[/i] if its endpoints are of different colors. Suppose that $\mathcal{V}$ is patriotic and the number of dazzling edges of $\mathcal{P}$ is even. Prove that there exists a line, not passing through any point in $\mathcal{V}$, dividing $\mathcal{V}$ into two nonempty patriotic subsets. [i]Ankan Bhattacharya[/i]

Could the three-dimensional space be expressed as the union of disjoint circumferences?

A real number $a$ satisfies the equality $\frac{1}{a} = a - [a]$. Prove that $a$ is irrational.

Let $p$ be an odd prime, and put $N=\frac{1}{4} (p^3 -p) -1.$ The numbers $1,2, \dots, N$ are painted arbitrarily in two colors, red and blue. For any positive integer $n \leqslant N,$ denote $r(n)$ the fraction of integers $\{ 1,2, \dots, n \}$ that are red. Prove that there exists a positive integer $a \in \{ 1,2, \dots, p-1\}$ such that $r(n) \neq a/p$ for all $n = 1,2, \dots , N.$ [I]Netherlands[/i]

Find all positive integers $n \geqslant 2$ for which there exist $n$ real numbers $a_1<\cdots<a_n$ and a real number $r>0$ such that the $\tfrac{1}{2}n(n-1)$ differences $a_j-a_i$ for $1 \leqslant i<j \leqslant n$ are equal, in some order, to the numbers $r^1,r^2,\ldots,r^{\frac{1}{2}n(n-1)}$.

We place randomly the numbers $1,2, \dots ,2006$ around a circle. A move consists of changing two neighbouring numbers. After a limited numbers of moves all the numbers are diametrically opposite to their starting position. Show that we changed at least once two numbers which had the sum $2007$.

Let $a$ and $b$ be positive integers. Show that if $4ab - 1$ divides $(4a^{2} - 1)^{2}$, then $a = b$. [i]Author: Kevin Buzzard and Edward Crane, United Kingdom [/i]

Let $n$ and $k$ be positive integers with $k<n$. Let $P(x)$ be a polynomial of degree $n$ with real coefficients, nonzero constant term, and no repeated roots. Suppose that for any real numbers $a_0,\,a_1,\,\ldots,\,a_k$ such that the polynomial $a_kx^k+\cdots+a_1x+a_0$ divides $P(x)$, the product $a_0a_1\cdots a_k$ is zero. Prove that $P(x)$ has a nonreal root.

If you draw $4$ points on the unit circle, prove that you can always find two points where their distance between is less than $\sqrt{2}.$

Let $a,b,c$ be non negative integers. Suppose that $c$ is even and $a^5+4b^5=c^5$. Prove that $b=0$.

Prove that $n^3-n-3$ is not a perfect square for any integer $n$. [i]Calvin Deng.[/i]

Let $\mathbb R_{>0}$ be the set of positive real numbers. Determine all functions $f \colon \mathbb R_{>0} \to \mathbb R_{>0}$ such that \[x \big(f(x) + f(y)\big) \geqslant \big(f(f(x)) + y\big) f(y)\] for every $x, y \in \mathbb R_{>0}$.

The kingdom of Anisotropy consists of $n$ cities. For every two cities there exists exactly one direct one-way road between them. We say that a [i]path from $X$ to $Y$[/i] is a sequence of roads such that one can move from $X$ to $Y$ along this sequence without returning to an already visited city. A collection of paths is called [i]diverse[/i] if no road belongs to two or more paths in the collection. Let $A$ and $B$ be two distinct cities in Anisotropy. Let $N_{AB}$ denote the maximal number of paths in a diverse collection of paths from $A$ to $B$. Similarly, let $N_{BA}$ denote the maximal number of paths in a diverse collection of paths from $B$ to $A$. Prove that the equality $N_{AB} = N_{BA}$ holds if and only if the number of roads going out from $A$ is the same as the number of roads going out from $B$. [i]Proposed by Warut Suksompong, Thailand[/i]

Let $n$ be a positive integer relatively prime to $6$. We paint the vertices of a regular $n$-gon with three colours so that there is an odd number of vertices of each colour. Show that there exists an isosceles triangle whose three vertices are of different colours.

Let $x$ and $y$ be positive integers. If ${x^{2^n}}-1$ is divisible by $2^ny+1$ for every positive integer $n$, prove that $x=1$.