Prove that the area of a unit cube's projection on any plane equals the length of its projection on the perpendicular to this plane.

Call a polygon on a Cartesian plane to be[i]integer[/i] if all its vertices are integer. A convex integer $14$-gon is cut into integer parallelograms with areas not greater than $C$. Find the minimal possible $C$. [i](A. Yuran)[/i]

Let $ABC$ be a triangle and $\omega$ its circumcircle. Point $D$ lies on the arc $BC$ (not containing $A$) of $\omega$ and is different from $B, C$ and the midpoint of arc $BC$ . The tangent line to $\omega$ at $D$ intersects lines $BC, CA,AB$ at $A', B',C'$ respectively. Lines $BB'$ and $CC'$ intersect at $E$. Line $AA' $ intersects again circle $\omega$ at $F$. Prove that the three points $D,E,F$ are colinear. Malik Talbi

Let $F_0 = 0, F_{1} = 1$, and for $n \ge 1, F_{n+1} = F_n + F_{n-1}$. Define $a_n = \left(\frac{1 + \sqrt{5}}{2}\right)^n \cdot F_n$ . Then there are rational numbers $A$ and $B$ such that $\frac{a_{30} + a_{29}}{a_{26} + a_{25}} = A + B \sqrt{5}$. Find $A + B$.

Given a matrix $\{a_{ij}\}_{i,j=0}^{9}$, $a_{ij}=10i+j+1$. Andrei is going to cover its entries by $50$ rectangles $1\times 2$ (each such rectangle contains two adjacent entries) so that the sum of $50$ products in these rectangles is minimal possible. Help him. [i]A. Badzyan[/i]

Let $x_1,x_2,\ldots,x_n$ be real numbers satisfying $x_1^2+x_2^2+\ldots+x_n^2=1$. Prove that for every integer $k\ge2$ there are integers $a_1,a_2,\ldots,a_n$, not all zero, such that $|a_i|\le k-1$ for all $i$, and $|a_1x_1+a_2x_2+\ldots+a_nx_n|\le{(k-1)\sqrt n\over k^n-1}$. [i](IMO Problem 3)[/i] [i]Proposed by Germany, FR[/i]

Find two consecutive integers with the property that the sums of their digits are each divisible by $2006$.

Let $n$ be a natural number and $L = Z^2$ the set of points on the plane with integer coordinates. Every point in $L$ is colored now in one of the colors red or green. Show that there are $n$ different points $x_1,...,x_n \in L$ all of which have the same color and whose center of gravity is also in $L$ and is of the same color.

Let $ABCD$ be a convex quadrilateral with $AB = BD = 8$ and $CD = DA = 6$. Let $P$ be a point on side $AB$ such that $DP$ is bisector of angle $\angle ADB$ and let $Q$ be a point on side $BC$ such that $DQ$ is bisector of angle $\angle CDB$. Calculate the radius of the circumcircle of triangle $DPQ$. Note: The circumcircle of a triangle is the circle that passes through its three vertices.

How many strings of length $5$ formed from the digits $0$,$1$,$2$,$3$,$4$ are there such that for each $j\in\{1,2,3,4\}$, at least $j$ of the digits are less than $j$? (For example, $02214$ satisfies the condition because it contains at least $1$ digit less than $1$, at least $2$ digits less than $2$, at least $3$ digits less than $3$, and at least $4$ digits less than $4$. The string $23404$ does not satisfy the condition because it does not contain at least $2$ digits less than $2$.) $\textbf{(A) }500\qquad\textbf{(B) }625\qquad\textbf{(C) }1089\qquad\textbf{(D) }1199\qquad\textbf{(E) }1296$

$p,q,r$ are real numbers satisfying \[\frac{(p+q)(q+r)(r+p)}{pqr} = 24\] \[\frac{(p-2q)(q-2r)(r-2p)}{pqr} = 10.\] Given that $\frac{p}{q} + \frac{q}{r} + \frac{r}{p}$ can be expressed in the form $\frac{m}{n}$, where $m,n$ are relatively prime positive integers, compute $m+n$. [i]Author: Alex Zhu[/i]

A $ 9 \times 12$ rectangle is partitioned into unit squares. The centers of all the unit squares, except for the four corner squares and eight squares sharing a common side with one of them, are coloured red. Is it possible to label these red centres $ C_1,C_2,\ldots ,C_{96}$ in such way that the following to conditions are both fulfilled i) the distances $C_1C_2,\ldots ,C_{95}C_{96}, C_{96}C_{1}$ are all equal to $ \sqrt {13}$, ii) the closed broken line $ C_1C_2\ldots C_{96}C_1$ has a centre of symmetry? [i]Bulgaria[/i]

What is the product of $ \dfrac{3}{2}\times \dfrac{4}{3}\times \dfrac{5}{4}\times \cdots \times \dfrac{2006}{2005}$? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 1002 \qquad \textbf{(C)}\ 1003 \qquad \textbf{(D)}\ 2005 \qquad \textbf{(E)}\ 2006$

The bisector of the angle $A$ of the triangle $ABC$ intersects the side $BC$ at $D$. A circle $c$ through the vertex $A$ touches the side $BC$ at $D$. Prove that the circumcircle of the triangle $ABC$ touches the circle $c$ at $A$.

The sequence of real numbers $a_0,a_1,a_2,\ldots$ is defined recursively by \[a_0=-1,\qquad\sum_{k=0}^n\dfrac{a_{n-k}}{k+1}=0\quad\text{for}\quad n\geq 1.\]Show that $ a_{n} > 0$ for all $ n\geq 1$. [i]Proposed by Mariusz Skalba, Poland[/i]

Consider a $2023\times2023$ board split into unit squares. Two unit squares are called adjacent is they share at least one vertex. Mahler and Srecko play a game on this board. Initially, Mahler has one piece placed on the square marked [b]M[/b], and Srecko has a piece placed on the square marked by [b]S[/b] (see the attachment). The players alternate moving their piece, following three rules: 1. A piece can only be moved to a unit square adjacent to the one it is placed on. 2. A piece cannot be placed on a unit square on which a piece has been placed before (once used, a unit square can never be used again). 3. A piece cannot be moved to a unit square adjacent to the square occupied by the opponent’s piece. A player wins the game if his piece gets to the corner diagonally opposite to its starting position (i.e. Srecko moves to $s_p$, Mahler moves to $m_p$) or if the opponent has to move but has no legal move. Mahler moves first. Which player has a winning strategy?

Let $ABC$ be a triangle with $BC=20$ and $CA=16$, and let $I$ be its incenter. If the altitude from $A$ to $BC$, the perpendicular bisector of $AC$, and the line through $I$ perpendicular to $AB$ intersect at a common point, then the length $AB$ can be written as $m+\sqrt{n}$ for positive integers $m$ and $n$. What is $100m+n$? [i] Proposed by Tristan Shin [/i]

Let $ABC$ be an acute angled triangle. Let $M$ be the midpoint of $BC$, and let $BE$ and $CF$ be the altitudes of the triangle. Let $D \ne M$ be a point on the circumcircle of the triangle $EFM$ such that $DE = DF$. Prove that $AD \perp BC$.

The orthogonal projection of a tetrahedron onto a plane containing one of its faces is a trapezoid of area $1$, which has only one pair of parallel sides. a) Is it possible that the orthogonal projection of this tetrahedron onto a plane containing another its face is a square of area $1$? b) The same question for a square of area $1/2019$. (Mikhail Evdokimov)

Each side face of a dodecahedron lies in a uniquely determined plane. Those planes cut the space in a finite number of disjoint [i]regions[/i]. Find the number of such regions.

On a $ \$10000$ order a merchant has a choice between three successive discounts of $ 20 \%$, $ 20 \%$, and $ 10\%$ and three successive discounts of $ 40 \%$, $ 5 \%$, and $ 5 \%$. By choosing the better offer, he can save: $ \textbf{(A)}\ \text{nothing at all} \qquad \textbf{(B)}\ \$440 \qquad \textbf{(C)}\ \$330 \qquad \textbf{(D)}\ \$345 \qquad \textbf{(E)}\ \$360$

In an isosceles triangle $ABC$ ($AB = AC$), the bisector of the angle $B$ intersects $AC$ at point $D$ such that $BC = BD + AD$. Find $\angle A$.

The ratio of the interior angles of two regular polygons with sides of unit length is $ 3: 2$. How many such pairs are there? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ \text{infinitely many}$

a) Points $B$ and $C$ are inside the segment $[AD]$. $|AB|=|CD|$. Prove that for all of the points P on the plane holds inequality $$|PA|+|PD|>|PB|+|PC|$$ b) Given four points $A,B,C,D$ on the plane. For all of the points $P$ on the plane holds inequality $$|PA|+|PD| > |PB|+|PC|.$$ Prove that points $B$ and C are inside the segment $[AD]$ and$ |AB|=|CD|$.

A function $f: R \to R$ satisfies the conditions: $f (x + 19) \le f (x) + 19$ and $f (x + 94) \ge f (x) + 94$ for all $x \in R$. Prove that $f (x + 1) = f (x) + 1$ for all $x \in R$.