$A$ and $B$ wish to divide a cake into two pieces. Each wants the largest piece he can get. The cake is a triangular prism with the triangular faces horizontal. $A$ chooses a point $P$ on the top face. $B$ then chooses a vertical plane through the point $P$ to divide the cake. $B$ chooses which piece to take. Which point $P$ should $A $ choose in order to secure as large a slice as possible?

The goal of this problem is to show that the maximum area of a polygon with a fixed number of sides and a fixed perimeter is achieved by a regular polygon. (a) Prove that the polygon with maximum area must be convex. (Hint: If any angle is concave, show that the polygon’s area can be increased.) (b) Prove that if two adjacent sides have different lengths, the area of the polygon can be increased without changing the perimeter. (c) Prove that the polygon with maximum area is equilateral, that is, has all the same side lengths. It is true that when given all four side lengths in order of a quadrilateral, the maximum area is achieved in the unique configuration in which the quadrilateral is cyclic, that is, it can be inscribed in a circle. (d) Prove that in an equilateral polygon, if any two adjacent angles are different then the area of the polygon can be increased without changing the perimeter. (e) Prove that the polygon of maximum area must be equiangular, or have all angles equal. (f ) Prove that the polygon of maximum area is a regular polygon. PS. You had better use hide for answers.

The planes $p$ and $p'$ are parallel. A polygon $P$ on $p$ has $m$ sides and a polygon $P'$ on $p'$ has $n$ sides. Find the largest and smallest distances between a vertex of $P$ and a vertex of $P'$.

The number $n$ is called a composite number if it can be written in the form $n = a\times b$, where $a, b$ are positive integers greater than $1$. Write number $2013$ in a sum of $m$ composite numbers. What is the largest value of $m$? (A): $500$, (B): $501$, (C): $502$, (D): $503$, (E): None of the above.

Let $c > 1$ be a real number. A function $f: [0 ,1 ] \to R$ is called c-friendly if $f(0) = 0, f(1) = 1$ and $|f(x) -f(y)| \le c|x - y|$ for all the numbers $x ,y \in [0,1]$. Find the maximum of the expression $|f(x) - f(y)|$ for all [i]c-friendly[/i] functions $f$ and for all the numbers $x,y \in [0,1]$.

Let $\{a_1,...,a_n\}\subset \{-1,1\}$ and $a>0$ . Denote by $X$ and $Y$ the number of collections $\{\varepsilon_1,...,\varepsilon_n\}\subset \{-1,1\}$, such that $$max_{1\le k\le n}(\varepsilon_1a_1+...+\varepsilon_ka_k) >\alpha$$ and $$\varepsilon_1a_1+...+\varepsilon_na_n>a$$ respectively. Prove that $X\le 2Y$.

Consider all arithmetical sequences of real numbers $(x_i)^{\infty}=1$ and $(y_i)^{\infty} =1$ with the common first term, such that for some $k > 1, x_{k-1}y_{k-1} = 42, x_ky_k = 30$, and $x_{k+1}y_{k+1} = 16$. Find all such pairs of sequences with the maximum possible $k$.

Hugo places a chess piece on the top left square of a $20 \times 20$ chessboard and makes $10$ moves with it. On each of these $10$ moves, he moves the piece either one square horizontally (left or right) or one square vertically (up or down). After the last move, he draws an $X$ on the square that the piece occupies. When Hugo plays the game over and over again, what is the largest possible number of squares that could eventually be marked with an $X$? Prove that your answer is correct.

Let $A,B,C$ be nodes of the lattice $Z\times Z$ such that inside the triangle $ABC$ lies a unique node $P$ of the lattice. Denote $E = AP \cap BC$. Determine max $\frac{AP}{PE}$ , over all such configurations.

Find the largest $k$ such that for every positive integer $n$ we can find at least $k$ numbers in the set $\{n+1, n+2, ... , n+16\}$ which are coprime with $n(n+17)$.

One side of a convex polygon is equal to $a$, the sum of exterior angles at the vertices not adjacent to this side are equal to $120^o$. Among such polygons, find the polygon of the largest area.

If all $x_k$ ($k = 1, 2, 3, 4, 5)$ are positive reals, and $\{a_1,a_2, a_3, a_4, a_5\} = \{1, 2,3 , 4, 5\}$, find the maximum of $$\frac{(\sqrt{s_1x_1} +\sqrt{s_2x_2}+\sqrt{s_3x_3}+\sqrt{s_4x_4}+\sqrt{s_5x_5})^2}{a_1x_1 + a_2x_2 + a_3x_3 + a_4x_4 + a_5x_5}$$ ($s_k = a_1 + a_2 +... + a_k$)

Each of the ${4n^2}$ unit squares of a ${2n \times 2n}$ board ${(n \ge 1) }$ has been colored blue or red. A set of four different unit squares of the board is called [i]pretty [/i]if these squares can be labeled ${A,B,C,D}$ in such a way that ${A}$ and ${B}$ lie in the same row, ${C}$ and ${D}$ lie in the same row, ${A}$ and ${C}$ lie in the same column, ${B}$ and ${D}$ lie in the same column, ${A}$ and ${D}$ are blue, and ${B}$ and ${C}$ are red. Determine the largest possible number of different [i]pretty [/i]sets on such a board. (Poland)

$12$ friends play a tennis tournament, where each plays only one game with any of the other eleven. Winner gets one points. Loser getos zero points, and there is no draw. Final points of the participants are $B_1, B_2, ..., B_{12}$. Find the largest possible value of the sum $\Sigma_3=B_1^3+B_2^3+ ... + B_{12}^3$ .

Let $X$ be the set of natural numbers whose all digits in the decimal representation are different. For $n \in N$, denote by $A_n$ the set of numbers whose digits are a permutation of the digits of $n$, and $d_n$ be the greatest common divisor of the numbers in $A_n$. (For example, $A_{1120} =\{112,121,...,2101,2110\}$, so $d_{1120} = 1$.) Find the maximum possible value of $d_n$.

Find the maximum value of $M =\frac{x}{2x + y} +\frac{y}{2y + z}+\frac{z}{2z + x}$ , $x,y, z > 0$