You have a paper pentagon, $ABCDE$, such that $AB = BC = 3$ cm, $CD = DE= 5$ cm, $EA = 4$ cm, $\angle ABC = 100^o$ ,$ \angle CDE = 80^o$. You have to divide the pentagon into four triangles, by three straight cuts, so that with the four triangles assemble a rectangle, without gaps or overlays. (The triangles can be rotated and / or turned around.)

Determine the roots of unity in the field of $ p$-adic numbers. [i]L. Fuchs[/i]

Is it possible to place $2012$ distinct circles with the same diameter on the plane, such that each circle touches at least three others circles?

For $ a_i \in \mathbb{Z}^ \plus{}$, $ i \equal{} 1, \ldots, k$, and $ n \equal{} \sum^k_{i \equal{} 1} a_i$, let $ d \equal{} \gcd(a_1, \ldots, a_k)$ denote the greatest common divisor of $ a_1, \ldots, a_k$. Prove that $ \frac {d} {n} \cdot \frac {n!}{\prod\limits^k_{i \equal{} 1} (a_i!)}$ is an integer. [i]Dan Schwarz, Romania[/i]

In each of (a) to (d) you have to find a strictly increasing surjective function from A to B or prove that there doesn't exist any. (a) $A=\{x|x\in \mathbb{Q},x\leq \sqrt{2}\}$ and $B=\{x|x\in \mathbb{Q},x\leq \sqrt{3}\}$ (b) $A=\mathbb{Q}$ and $B=\mathbb{Q}\cup \{\pi \} $ In (c) and (d) we say $(x,y)>(z,t)$ where $x,y,z,t \in \mathbb{R}$ , whenever $x>z$ or $x=z$ and $y>t$. (c) $A=\mathbb{R}$ and $B=\mathbb{R}^2$ (d) $X=\{2^{-x}| x\in \mathbb{N}\}$ , then $A=X \times (X\cup \{0\})$ and $B=(X \cup \{ 0 \}) \times X$ (e) If $A,B \subset \mathbb{R}$ , such that there exists a surjective non-decreasing function from $A$ to $B$ and a surjective non-decreasing function from $B$ to $A$ , does there exist a surjective strictly increasing function from $B$ to $A$? Time allowed for this problem was 2 hours.

In a non isoceles triangle $ABC$, let the perpendicular bisector of $[BC]$ intersect $(ABC)$ at $M$ and $N$ respectively. Let the midpoints of $[AM]$ and $[AN]$ be $K$ and $L$ respectively. Let $(ABK)$ and $(ABL)$ intersect $AC$ again at $D$ and $E$ respectively, let $(ACK)$ and $(ACL)$ intersect $AB$ again at $F$ and $G$ respectively. Prove that the lines $DF$, $EG$ and $MN$ are concurrent.

On the circumcircle of triangle $ABC$, point $P$ is chosen, such that the perpendicular drawn from point $P$ to line $AC$ intersects the circle again at a point $Q$, the perpendicular drawn from point $Q$ to line $AB$ intersects the circle again at a point $R$ and the perpendicular drawn from point $R$ to line $BC$ intersects the circle again at the initial point $P$. Let $O$ be the centre of this circle. Prove that $\angle POC = 90^o$.

Crocodile chooses $1$ x $4$ tile from $2018$ x $2018$ square.The bear has tilometer that checks $3$x$3$ square of $2018$ x $2018$ is there any of choosen cells by crocodile.Tilometer says "YES" if there is at least one choosen cell among checked $3$ x $3$ square.For what is the smallest number of such questions the Bear can certainly get an affirmative answer?

In triangle $ABC$, $AD$ and $AH$ are the angle bisector and the altitude of vertex $A$, respectively. The perpendicular bisector of $AD$, intersects the semicircles with diameters $AB$ and $AC$ which are drawn outside triangle $ABC$ in $X$ and $Y$, respectively. Prove that the quadrilateral $XYDH$ is concyclic. [i]Proposed by Mahan Malihi[/i]

Let $ABC$ be an acute triangle. The point $B'$ of the line $CA$ is such that $A$, $C$ and $B'$ are in that order on the line and $B'C=AB$; the point $C'$ of the line $AB$ is such that $A$, $B$ and $C'$ are in that order on the line and $C'B=AC$. Prove that the circumcenter of triangle $AB'C'$ belongs to the circumcircle of triangle $ABC$.

A grasshopper is jumping about in a grid. From the point with coordinates $(a, b)$ it can jump to either $(a + 1, b),(a + 2, b),(a + 1, b + 1),(a, b + 2)$ or $(a, b + 1)$. In how many ways can it reach the line $x + y = 2014?$ Where the grasshopper starts in $(0, 0)$.

Chord $ \left[AD\right]$ is perpendicular to the diameter $ \left[BC\right]$ of a circle. Let $ E$ and $ F$ be the midpoints of the arcs $ AC$ and $ CD$, respectively. If $ AD\bigcap BE\equal{}\left\{G\right\}$, $ AF\bigcap BC\equal{}\left\{H\right\}$ and $ m(AC)\equal{}\alpha$, find the measure of angle $ BHC$ in terms of $ \alpha$. $\textbf{(A)}\ 90{}^\circ \minus{}\frac{\alpha }{2} \qquad\textbf{(B)}\ 60{}^\circ \minus{}\frac{\alpha }{3} \qquad\textbf{(C)}\ \alpha \minus{}30{}^\circ \\ \qquad\textbf{(D)}\ 15{}^\circ \plus{}\frac{\alpha }{2} \qquad\textbf{(E)}\ \frac{180{}^\circ \minus{}2\alpha }{3}$

A collection $F$ of distinct (not necessarily non-empty) subsets of $X = \{1,2,\ldots,300\}$ is [i]lovely[/i] if for any three (not necessarily distinct) sets $A$, $B$ and $C$ in $F$ at most three out of the following eight sets are non-empty \begin{align*}A \cap B \cap C, \ \ \ \overline{A} \cap B \cap C, \ \ \ A \cap \overline{B} \cap C, \ \ \ A \cap B \cap \overline{C}, \\ \overline{A} \cap \overline{B} \cap C, \ \ \ \overline{A} \cap B \cap \overline {C}, \ \ \ A \cap \overline{B} \cap \overline{C}, \ \ \ \overline{A} \cap \overline{B} \cap \overline{C} \end{align*} where $\overline{S}$ denotes the set of all elements of $X$ which are not in $S$. What is the greatest possible number of sets in a lovely collection?

Let $ a,b,c$ be real numbers. Prove that $ (ab\plus{}bc\plus{}ca\minus{}1)^2 \le (a^2\plus{}1)(b^2\plus{}1)(c^2\plus{}1)$.

Let $A_1,A_2,\ldots,A_n$ be subsets of a finite set $S$ such that $|A_j|=8$ for each $j$. For a subset $B$ of $S$ let $F(B)=\{j \mid 1\le j\le n \ \ \text{and} \ A_j \subset B\}$. Suppose for each subset $B$ of $S$ at least one of the following conditions holds [list][b](a)[/b] $|B| > 25$, [b](b)[/b] $F(B)={\O}$, [b](c)[/b] $\bigcap_{j\in F(B)} A_j \neq {\O}$.[/list] Prove that $A_1\cap A_2 \cap \cdots \cap A_n \neq {\O}$.

If an integer $a > 1$ is given such that $\left(a-1\right)^3+a^3+\left(a+1\right)^3$ is the cube of an integer, then show that $4\mid a$.

Suppose that k and x are positive integers such that $$\frac{k}{2}=\left( \sqrt{1 +\frac{\sqrt3}{2}}\right)^x+\left( \sqrt{1 -\frac{\sqrt3}{2}}\right)^x.$$ Find the sum of all possible values of $k$

Elmo makes $ N$ sandwiches for a fundraiser. For each sandwich he uses $ B$ globs of peanut butter at 4 cents per glob and $ J$ blobs of jam at 5 cents per glob. The cost of the peanut butter and jam to make all the sandwiches is $ \$$2.53. Assume that $ B, J,$ and $ N$ are all positive integers with $ N > 1$. What is the cost of the jam Elmo uses to make the sandwiches? $ \textbf{(A) } \$1.05 \qquad \textbf{(B) } \$1.25 \qquad \textbf{(C) } \$1.45 \qquad \textbf{(D) } \$1.65 \qquad \textbf{(E) } \$1.85$

Let $\otimes$ be a binary operation that takes two positive real numbers and returns a positive real number. Suppose further that $\otimes$ is continuous, commutative $(a\otimes b=b\otimes a)$, distributive across multiplication $(a\otimes(bc)=(a\otimes b)(a\otimes c))$, and that $2\otimes 2=4$. Solve the equation $x\otimes y=x$ for $y$ in terms of $x$ for $x>1$.

Given three reals $a_1,\,a_2,\,a_3>1,\,S=a_1+a_2+a_3$. Provided ${a_i^2\over a_i-1}>S$ for every $i=1,\,2,\,3$ prove that \[\frac{1}{a_1+a_2}+\frac{1}{a_2+a_3}+\frac{1}{a_3+a_1}>1.\]

Let $ ABCD$ be a quadrilateral, and $ E$ be intersection points of $ AB,CD$ and $ AD,BC$ respectively. External bisectors of $ DAB$ and $ DCB$ intersect at $ P$, external bisectors of $ ABC$ and $ ADC$ intersect at $ Q$ and external bisectors of $ AED$ and $ AFB$ intersect at $ R$. Prove that $ P,Q,R$ are collinear.

See all the problems from 5-th Kyiv math festival [url=http://www.mathlinks.ro/Forum/viewtopic.php?p=506789#p506789]here[/url] Let $O$ be the circumcenter and $H$ be the intersection point of the altitudes of acute triangle $ABC.$ The straight lines $BH$ and $CH$ intersect the segments $CO$ and $BO$ at points $D$ and $E$ respectively. Prove that if triangles $ODH$ and $OEH$ are isosceles then triangle $ABC$ is isosceles too.

Let $n$ be a positive integer and $A$ a set containing $8n + 1$ positive integers co-prime with $6$ and less than $30n$. Prove that there exist $a, b \in A$ two different numbers such that $a$ divides $b$.

Prove the identity $ \frac{n-1}{2}=\sum_{k=1}^n \left\{ \frac{m+k-1}{n} \right\} , $ where $ n\ge 2, m $ are natural numbers, and $ \{\} $ denotes the fractional part.

Let $P(x)$ be a monic polynomial with integer coefficients of degree $10$. Prove that there exist distinct positive integers $a,b$ not exceeding $101$ such that $P(a)-P(b)$ is divisible by $101$.