For an integer $m\geq 1$, we consider partitions of a $2^m\times 2^m$ chessboard into rectangles consisting of cells of chessboard, in which each of the $2^m$ cells along one diagonal forms a separate rectangle of side length $1$. Determine the smallest possible sum of rectangle perimeters in such a partition. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

The circle $\gamma$ passing through the vertex $A$ of triangle $ABC$ intersects its sides $AB$ and $AC$ for the second time at points $X$ and $Y$, respectively. Also, the circle $\gamma$ intersects side $BC$ at points $D$ and $E$ so that $AD = AE$. Prove that the points $B, X, Y, C$ lie on the same circle. [i]Proposed by Mykhailo Shtandenko[/i]

Solve the equation ("$2$" encounters $1985$ times): $$\dfrac{x}{2+ \dfrac{x}{2+\dfrac{x}{2+... \dfrac{x}{2+\sqrt {1+x}}}}}=1$$

Let $n$ be a positive integer. Prove that there is no positive integer solution to thxe equation $(x + 2)^n - x^n = 1 + 7^n$.

Determine all the solutions of the equation $x^3 + y^3 + z^3 = wx^2y^2z^2$ in natural numbers $x, y, z, w$. Justify your answer

Let $n \geq 2$ be an integer. Lucia chooses $n$ real numbers $x_1,x_2,\ldots,x_n$ such that $\left| x_i-x_j \right|\geq 1$ for all $i\neq j$. Then, in each cell of an $n \times n$ grid, she writes one of these numbers, in such a way that no number is repeated in the same row or column. Finally, for each cell, she calculates the absolute value of the difference between the number in the cell and the number in the first cell of its same row. Determine the smallest value that the sum of the $n^2$ numbers that Lucia calculated can take.

Let $f(x)=x^3-6x^2+\tfrac{25}{2}x-7$. There is an interval $[a,b]$ such that for any real number $x$, the sequence $x,f(x),f(f(x)),\dots$ is bounded (i.e., has a lower and upper bound) if and only if $x\in[a,b]$. Compute $(a-b)^2$.

Given are two coprime positive integers $a, b$ with $b$ odd and $a>2$. The sequence $(x_n)$ is defined by $x_0=2, x_1=a$ and $x_{n+2}=ax_{n+1}+bx_n$ for $n \geq 1$. Prove that: $a)$ If $a$ is even then there do not exist positive integers $m, n, p$ such that $\frac{x_m} {x_nx_p}$ is a positive integer. $b)$ If $a$ is odd then there do not exist positive integers $m, n, p$ such that $mnp$ is even and $\frac{x_m} {x_nx_p}$ is a perfect square.

A pentagon has vertices labelled $A, B, C, D, E$ in that order counterclockwise, such that $AB$, $ED$ are parallel and $\angle EAB = \angle ABD = \angle ACD = \angle CDA$. Furthermore, suppose that$ AB = 8$, $AC = 12$, $AE = 10$. If the area of triangle $CDE$ can be expressed as $\frac{a \sqrt{b}}{c}$, where $a, b, c$ are integers so that $b$ is square free, and $a, c$ are relatively prime, find $a + b + c$.

In an acute traingle $ABC$ with $AB< BC$ let $BH_b$ be its altitude, and let $O$ be the circumcenter. A line through $H_b$ parallel to $CO$ meets $BO$ at $X$. Prove that $X$ and the midpoints of $AB$ and $AC$ are collinear.

Show that any number of the form $$4444 ...44 88...8$$ where there are twice as many $4$s as $8$s is a square number.

Squares $CAKL$ and $CBMN$ are constructed on the sides of acute-angled triangle $ABC$, outside of the triangle. Line $CN$ intersects line segment $AK$ at $X$, while line $CL$ intersects line segment $BM$ at $Y$. Point $P$, lying inside triangle $ABC$, is an intersection of the circumcircles of triangles $KXN$ and $LYM$. Point $S$ is the midpoint of $AB$. Prove that angle $\angle ACS=\angle BCP$.

Let $ABCD$ be an isosceles trapezoid, $AD=BC$, $AB \parallel CD$. The diagonals of the trapezoid intersect at the point $O$, and the point $M$ is the midpoint of the side $AD$. The circle circumscribed around the triangle $BCM$ intersects the side $AD$ at the point $K$. Prove that $OK \parallel AB$.

It is given that for some $n \in \mathbb{N}$ there exists a natural number $a$, such that $a^{n-1} \equiv 1 \pmod{n}$ and that for any prime divisor $p$ of $n-1$ we have $a^{\frac{n-1}{p}} \not \equiv 1 \pmod{n}$. Prove that $n$ is a prime.

Let $ABC$ be an acute-angled triangle. In $ABC$, $AB \neq AB$, $K$ is the midpoint of the the median $AD$, $DE \perp AB$ at $E$, $DF \perp AC$ at $F$. The lines $KE$, $KF$ intersect the line $BC$ at $M$, $N$, respectively. The circumcenters of $\triangle DEM$, $\triangle DFN$ are $O_1, O_2$, respectively. Prove that $O_1 O_2 \parallel BC$.

Find the maximum possible value obtainable by inserting a single set of parentheses into the expression $1 + 2 \times 3 + 4 \times 5 + 6$.

Let $ABCD$ be a quadrilateral inscribed in a circle $k$. Let the lines $AC\cap BD=O$, $AD\cap BC=P$, and $AB\cap CD=Q$. Line $QO$ intersects $k$ in points $M$ and $N$. Prove that $PM$ and $PN$ are tangent to $k$.

Let $\omega \ne 1$ be a $13$th root of unity. Find the remainder when \[ \prod_{k=0}^{12} \left(2 - 2\omega^k + \omega^{2k} \right) \] is divided by $1000$.

In triangle $ABC$ points $B_1$ and $C_1$ are on $AB$ and $AC$ respectively and $P{}$ is a point on the segment $B_1C_1$. Find the greatest possible value of $\frac{\min\{S(BPB_1),S(CPC_1)\}}{S(ABC)}$, where $S(XYZ)$ is the area o the triangle $ABC$.

Evaluate \[\int_0^{\pi} xp^x\cos qx\ dx,\ \int_0^{\pi} xp^x\sin qx\ dx\ (p>0,\ p\neq 1,\ q\in{\mathbb{N^{+}}})\] Own

The points with integer coordinates are painted by red if the product of $x$ and $y$ coordinates is divisible by $6$. Otherwise the points with integer coordinates are painted by white. Consider a very big square whose sides are parallel to the axis of the $xy-$plane. The ratio of white points over red points inside this square will be closer to $\textbf{(A)}\ \frac75 \qquad\textbf{(B)}\ \frac32 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ \frac43 \qquad\textbf{(E)}\ \frac54$

We call a subset $B$ of natural numbers [i]loyal[/i] if there exists natural numbers $i\le j$ such that $B=\{i,i+1,\ldots,j\}$. Let $Q$ be the set of all [i]loyal[/i] sets. For every subset $A=\{a_1<a_2<\ldots<a_k\}$ of $\{1,2,\ldots,n\}$ we set \[f(A)=\max_{1\le i \le k-1}{a_{i+1}-a_i}\qquad\text{and}\qquad g(A)=\max_{B\subseteq A, B\in Q} |B|.\] Furthermore, we define \[F(n)=\sum_{A\subseteq \{1,2,\ldots,n\}} f(A)\qquad\text{and}\qquad G(n)=\sum_{A\subseteq \{1,2,\ldots,n\}} g(A).\] Prove that there exists $m\in \mathbb N$ such that for each natural number $n>m$ we have $F(n)>G(n)$. (By $|A|$ we mean the number of elements of $A$, and if $|A|\le 1$, we define $f(A)$ to be zero). [i]Proposed by Javad Abedi[/i]

Show that: a) There are infinitely many positive integers $n$ such that there exists a square equal to the sum of the squares of $n$ consecutive positive integers (for instance, $2$ is one such number as $5^2=3^2+4^2$). b) If $n$ is a positive integer which is not a perfect square, and if $x$ is an integer number such that $x^2+(x+1)^2+...+(x+n-1)^2$ is a perfect square, then there are infinitely many positive integers $y$ such that $y^2+(y+1)^2+...+(y+n-1)^2$ is a perfect square.

Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that (i): For different reals $x,y$, $f(x) \not= f(y)$. (ii): For all reals $x,y$, $f(x+f(f(-y)))=f(x)+f(f(y))$

In convex hexagon $ABCDEF$, we know that $\angle BCA = \angle DEC = \angle AFB = \angle CBD = \angle EDF.$ Prove that $AB = CD = EF.$