Let $ABCD$ be a rectangle. Determine the set of all points $P$ from the region between the parallel lines $AB$ and $CD$ such that $\angle APB=\angle CPD$.

Nine people sit down for dinner where there are three choices of meals. Three people order the beef meal, three order the chicken meal, and three order the fish meal. The waiter serves the nine meals in random order. Find the number of ways in which the waiter could serve the meal types to the nine people such that exactly one person receives the type of meal ordered by that person.

There is given a convex quadrilateral $ ABCD$. Prove that there exists a point $ P$ inside the quadrilateral such that \[ \angle PAB \plus{} \angle PDC \equal{} \angle PBC \plus{} \angle PAD \equal{} \angle PCD \plus{} \angle PBA \equal{} \angle PDA \plus{} \angle PCB = 90^{\circ} \] if and only if the diagonals $ AC$ and $ BD$ are perpendicular. [i]Proposed by Dusan Djukic, Serbia[/i]

An $8\times 8$ chessboard is to be tiled (i.e., completely covered without overlapping) with pieces of the following shapes: [asy] unitsize(.6cm); draw(unitsquare,linewidth(1)); draw(shift(1,0)*unitsquare,linewidth(1)); draw(shift(2,0)*unitsquare,linewidth(1)); label("\footnotesize $1\times 3$ rectangle",(1.5,0),S); draw(shift(8,1)*unitsquare,linewidth(1)); draw(shift(9,1)*unitsquare,linewidth(1)); draw(shift(10,1)*unitsquare,linewidth(1)); draw(shift(9,0)*unitsquare,linewidth(1)); label("\footnotesize T-shaped tetromino",(9.5,0),S); [/asy] The $1\times 3$ rectangle covers exactly three squares of the chessboard, and the T-shaped tetromino covers exactly four squares of the chessboard. [list](a) What is the maximum number of pieces that can be used? (b) How many ways are there to tile the chessboard using this maximum number of pieces?[/list]

Let $A=(0,0)$ and $B=(b,2)$ be points on the coordinate plane. Let $ABCDEF$ be a convex equilateral hexagon such that $\angle FAB=120^\circ,$ $\overline{AB}\parallel \overline{DE},$ $\overline{BC}\parallel \overline{EF,}$ $\overline{CD}\parallel \overline{FA},$ and the y-coordinates of its vertices are distinct elements of the set $\{0,2,4,6,8,10\}.$ The area of the hexagon can be written in the form $m\sqrt{n},$ where $m$ and $n$ are positive integers and n is not divisible by the square of any prime. Find $m+n.$

The graphs of the equations \[ y=k, \qquad y=\sqrt{3}x+2k, \qquad y=-\sqrt{3}x+2k, \] are drawn in the coordinate plane for $k=-10,-9,-8,\ldots,9,10.$ These 63 lines cut part of the plane into equilateral triangles of side $2/\sqrt{3}.$ How many such triangles are formed?

On the plane are three straight lines $\ell_1, \ell_2,\ell_3$, forming a triangle, and the point $O$ is marked, the center of the circumscribed circle of this triangle. For an arbitrary point X of the plane, we denote by $X_i$ the point symmetric to the point X with respect to the line $\ell_i, i = 1,2,3$. a) Prove that for an arbitrary point $M$ the straight lines connecting the midpoints of the segments $O_1O_2$ and $M_1M_2, O_2O_3$ and $M_2M_3, O_3O_1$ and $M_3M_1$ intersect at one point, b) where can this intersection point lie?

Three one-inch squares are palced with their bases on a line. The center square is lifted out and rotated $ 45^\circ$, as shown. Then it is centered and lowered into its original location until it touches both of the adjoining squares. How many inches is the point $ B$ from the line on which the bases of the original squares were placed? [asy]unitsize(1inch); defaultpen(linewidth(.8pt)+fontsize(8pt)); draw((0,0)--((1/3) + 3*(1/2),0)); fill(((1/6) + (1/2),0)--((1/6) + (1/2),(1/2))--((1/6) + 1,(1/2))--((1/6) + 1,0)--cycle, rgb(.7,.7,.7)); draw(((1/6),0)--((1/6) + (1/2),0)--((1/6) + (1/2),(1/2))--((1/6),(1/2))--cycle); draw(((1/6) + (1/2),0)--((1/6) + (1/2),(1/2))--((1/6) + 1,(1/2))--((1/6) + 1,0)--cycle); draw(((1/6) + 1,0)--((1/6) + 1,(1/2))--((1/6) + (3/2),(1/2))--((1/6) + (3/2),0)--cycle); draw((2,0)--(2 + (1/3) + (3/2),0)); draw(((2/3) + (3/2),0)--((2/3) + 2,0)--((2/3) + 2,(1/2))--((2/3) + (3/2),(1/2))--cycle); draw(((2/3) + (5/2),0)--((2/3) + (5/2),(1/2))--((2/3) + 3,(1/2))--((2/3) + 3,0)--cycle); label("$B$",((1/6) + (1/2),(1/2)),NW); label("$B$",((2/3) + 2 + (1/4),(29/30)),NNE); draw(((1/6) + (1/2),(1/2)+0.05)..(1,.8)..((2/3) + 2 + (1/4)-.05,(29/30)),EndArrow(HookHead,3)); fill(((2/3) + 2 + (1/4),(1/4))--((2/3) + (5/2) + (1/10),(1/2) + (1/9))--((2/3) + 2 + (1/4),(29/30))--((2/3) + 2 - (1/10),(1/2) + (1/9))--cycle, rgb(.7,.7,.7)); draw(((2/3) + 2 + (1/4),(1/4))--((2/3) + (5/2) + (1/10),(1/2) + (1/9))--((2/3) + 2 + (1/4),(29/30))--((2/3) + 2 - (1/10),(1/2) + (1/9))--cycle);[/asy]$ \textbf{(A)}\ 1\qquad \textbf{(B)}\ \sqrt {2}\qquad \textbf{(C)}\ \frac {3}{2}\qquad \textbf{(D)}\ \sqrt {2} \plus{} \frac {1}{2}\qquad \textbf{(E)}\ 2$

See all the problems from 5-th Kyiv math festival [url=http://www.mathlinks.ro/Forum/viewtopic.php?p=506789#p506789]here[/url] Find all positive integers $a, b, c$ such that $3abc+11(a+b+c)=6(ab+bc+ac)+18.$

Determine the maximum value attained by \[\dfrac{x^4-x^2}{x^6+2x^3-1}\] over real numbers $x>1.$

Prove that the group of orientation-preserving symmetries of the cube is isomorphic to $S_4$ (the group of permutations of $\{1,2,3,4\}$).(20 points)

Let $ABC$ be a triangle. The incircle of triangle $ABC$ touches the side $BC$ at $A^{\prime}$, and the line $AA^{\prime}$ meets the incircle again at a point $P$. Let the lines $CP$ and $BP$ meet the incircle of triangle $ABC$ again at $N$ and $M$, respectively. Prove that the lines $AA^{\prime}$, $BN$ and $CM$ are concurrent.

Let $f$ be a function from the set of integers to the set of positive integers. Suppose that, for any two integers $m$ and $n$, the difference $f(m) - f(n)$ is divisible by $f(m- n)$. Prove that, for all integers $m$ and $n$ with $f(m) \leq f(n)$, the number $f(n)$ is divisible by $f(m)$. [i]Proposed by Mahyar Sefidgaran, Iran[/i]

A hexagon is inscribed in a circle. Five of the sides have length 81 and the sixth, denoted by $\overline{AB}$, has length 31. Find the sum of the lengths of the three diagonals that can be drawn from $A$.

Let $P,Q$ be the midpoints of diagonals $AC,BD$ in cyclic quadrilateral $ABCD$. If $\angle BPA=\angle DPA$, prove that $\angle AQB=\angle CQB$.

Find all positive integers $a$ and $b$ such that $(a + b^2)(b + a^2) = 2^m$ for some integer $m.$ [i](6 points)[/i]

If $ a\geq b\geq c\geq d > 0$ such that $ abcd\equal{}1$, then prove that \[ \frac 1{1\plus{}a} \plus{} \frac 1{1\plus{}b} \plus{} \frac 1{1\plus{}c} \geq \frac {3}{1\plus{}\sqrt[3]{abc}}.\]

Let $ABC$ be a triangle and $G$ its centroid. Let $G_a, G_b$ and $G_c$ be the orthogonal projections of $G$ on sides $BC, CA$, respectively $AB$. If $S_a, S_b$ and $S_c$ are the symmetrical points of $G_a, G_b$, respectively $G_c$ with respect to $G$, prove that $AS_a, BS_b$ and $CS_c$ are concurrent. Liana Topan

$ ABCD$ is a $ 4\times 4$ square. $ E$ is the midpoint of $ \left[AB\right]$. $ M$ is an arbitrary point on $ \left[AC\right]$. How many different points $ M$ are there such that $ \left|EM\right|\plus{}\left|MB\right|$ is an integer? $\textbf{(A)}\ 2 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 4 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ 6$

Tanya and Serezha take turns putting chips in empty squares of a chessboard. Tanya starts with a chip in an arbitrary square. At every next move, Serezha must put a chip in the column where Tanya put her last chip, while Tanya must put a chip in the row where Serezha put his last chip. The player who cannot make a move loses. Which of the players has a winning strategy? [i]Proposed by A. Golovanov[/i]

Let $ ABCDEF$ be a regular hexagon. Let $ G$, $ H$, $ I$, $ J$, $ K$, and $ L$ be the midpoints of sides $ AB$, $ BC$, $ CD$, $ DE$, $ EF$, and $ AF$, respectively. The segments $ AH$, $ BI$, $ CJ$, $ DK$, $ EL$, and $ FG$ bound a smaller regular hexagon. Let the ratio of the area of the smaller hexagon to the area of $ ABCDEF$ be expressed as a fraction $ \frac {m}{n}$ where $ m$ and $ n$ are relatively prime positive integers. Find $ m \plus{} n$.

How many ordered four-tuples of integers $(a,b,c,d)$ with $0 < a < b < c < d < 500$ satisfy $a + d = b + c$ and $bc - ad = 93$?

Find the area of the figure bounded by two curves $y=x^4,\ y=x^2+2$.

Let $p\ge 17$ be a prime. Prove that $t=3$ is the largest positive integer which satisfies the following condition: For any integers $a,b,c,d$ such that $abc$ is not divisible by $p$ and $(a+b+c)$ is divisible by $p$, there exists integers $x,y,z$ belonging to the set $\{0,1,2,\ldots , \left\lfloor \frac{p}{t} \right\rfloor - 1\}$ such that $ax+by+cz+d$ is divisible by $p$.

How many of the numbers \[ a_1\cdot 5^1+a_2\cdot 5^2+a_3\cdot 5^3+a_4\cdot 5^4+a_5\cdot 5^5+a_6\cdot 5^6 \] are negative if $a_1,a_2,a_3,a_4,a_5,a_6 \in \{-1,0,1 \}$? $ \textbf{(A)}\ 121 \qquad\textbf{(B)}\ 224 \qquad\textbf{(C)}\ 275 \qquad\textbf{(D)}\ 364 \qquad\textbf{(E)}\ 375 $