Let $E$ be a finite set of points such that $E$ is not contained in a plane and no three points of $E$ are collinear. Show that at least one of the following alternatives holds: (i) $E$ contains five points that are vertices of a convex pyramid having no other points in common with $E;$ (ii) some plane contains exactly three points from $E.$

The normals to a surface all intersect a fixed straight line. Show that the surface is a portion of a surface of revolution.

We say that a sequence $a_1,a_2,\cdots$ is [i]expansive[/i] if for all positive integers $j,\; i<j$ implies $|a_i-a_j|\ge \tfrac 1j$. Find all positive real numbers $C$ for which one can find an expansive sequence in the interval $[0,C]$.

Six cities are located at the vertices of a convex hexagon, all angles of which are equal. Three sides of this hexagon have length $a$, and the remaining three have length $b$ ($a \le b$). It is necessary to connect these cities with a network of roads so that from each city you can drive to any other (possibly through other cities). Find the shortest length of such a road network.

$ A',B',C' $ are the feet of the heights of an acute-angled triangle $ ABC. $ Calculate $$ \frac{\text{area} (ABC)}{\text{area}\left( A'B'C'\right)} , $$ knowing that $ ABC $ and $ A'B'C' $ have the same center of mass. [i]Carmen[/i] and [i]Viorel Botea[/i]

The real numbers $a, b, c$ are such that $a^2 + b^2 = 2c^2$, and also such that $a \ne b, c \ne -a, c \ne -b$. Show that \[\frac{(a+b+2c)(2a^2-b^2-c^2)}{(a-b)(a+c)(b+c)}\] is an integer.

Determine, for each positive integer $n$, the largest positive integer $k$ such that $2^k$ is a divisor of $3^n+1$.

Kevin is at the point $(19,12)$. He wants to walk to a point on the ellipse $9x^2 + 25y^2 = 8100$, and then walk to $(-24, 0)$. Find the shortest length that he has to walk. [i]Proposed by Kevin Zhao[/i]

A quadrilateral is given, in which the lengths of some two sides are equal to $1$ and $4$. Also, the diagonal of length $2$ divides it into two isosceles triangles. Find the perimeter of this quadrilateral.

Find all real numbers $ x$ such that $ 4x^5 \minus{} 7$ and $ 4x^{13} \minus{} 7$ are both perfect squares.

Let $a,b,c$ be positive real numbers such that $2a^2 +b^2=9c^2$.Prove that $\displaystyle \frac{2c}{a}+\frac cb \ge\sqrt 3$.

Let $I\subset \mathbb R$ be a non-empty open interval, $\varepsilon\geq 0$ and $f\colon I\rightarrow\mathbb R$ a function satisfying the $$f(tx+(1-t)y)\leq tf(x)+(1-t)f(y)+\varepsilon t(1-t)|x-y|$$ inequality for all $x,y\in I$ and $t\in [0,1]$. Prove that there exists a convex $g\colon I\rightarrow\mathbb R$ function, such that the function $l :=f-g$ has the $\varepsilon$-Lipschitz property, that is $$|l(x)-l(y)|\leq \varepsilon|x-y|\text{ for all }x,y\in I$$

Let $ABC$ be a non-equilateral triangle and let $M_a$, $M_b$, $M_c$ be the midpoints of the sides $BC$, $CA$, $AB$, respectively. Let $S$ be a point lying on the Euler line. Denote by $X$, $Y$, $Z$ the second intersections of $M_aS$, $M_bS$, $M_cS$ with the nine-point circle. Prove that $AX$, $BY$, $CZ$ are concurrent.

Find all triples (m,n,N) of positive integers numbers m,n and N such that $m^N-n^N=2^{100}$ with N>1

Let $ABCD$ be a convex quadrilateral whose diagonals $AC$ and $BD$ intersect at point $O$. Let a line through $O$ intersect segment $AB$ at $M$ and segment $CD$ at $N$. Prove that the segment $MN$ is not longer than at least one of the segments $AC$ and $BD$.

There are $2014$ airports in the faraway land of Artinia. Each pair of airports is connected by a nonstop flight in one or both directions. Show that there is some airport from which it is possible to reach every other airport in at most two flights.

If $n\ge2$ is an integer, prove the equality $$\lfloor\log_2n\rfloor+\lfloor\log_3n\rfloor+\ldots+\lfloor\log_nn\rfloor=\left\lfloor\sqrt n\right\rfloor+\left\lfloor\sqrt[3]n\right\rfloor+\ldots+\left\lfloor\sqrt[n]n\right\rfloor.$$

Suppose that $f$ is a function on the interval $[1,3]$ such that $-1\le f(x)\le 1$ for all $x$ and $\displaystyle \int_1^3f(x)\,dx=0.$ How large can $\displaystyle\int_1^3\frac{f(x)}x\,dx$ be?

A four-digit number has the property that the units digit equals the tens digit increased by $1$, the hundreds digit equals twice the tens digit, and the thousands digit is at least twice the units. Determine this four-digit number, knowing that it is twice a prime number.

A $100 \times 100$ table is given. At the beginning, every unit square has number $"0"$ written in them. Two players playing a game and the game stops after $200$ steps (each player plays $100$ steps). In every step, one can choose a row or a column and add $1$ to the written number in all of it's squares $\pmod 3.$ First player is the winner if more than half of the squares ($5000$ squares) have the number $"1"$ written in them, Second player is the winner if more than half of the squares ($5000$ squares) have the number $"0"$ written in them. Otherwise, the game is draw. Assume that both players play at their best. What will be the result of the game ? [i]Proposed by Mahyar Sefidgaran[/i]

In acute triangle $ABC$ $(AB < AC)$ let $D$, $E$ and $F$ be foots of perpedicular from $A$, $B$ and $C$ to $BC$, $CA$ and $AB$, respectively. Let $P$ and $Q$ be points on line $EF$ such that $DP \perp EF$ and $BQ=CQ$. Prove that $\angle ADP = \angle PBQ$

In July 1861, $ 366$ inches of rain fell in Cherrapunji, India. What was the average rainfall in inches per hour during that month? \[ \textbf{(A)}\ \frac{366}{31 \times 24} \qquad \textbf{(B)}\ \frac{366 \times 31}{24} \qquad \textbf{(C)}\ \frac{366 \times 24}{31} \\ \textbf{(D)}\ \frac{31 \times 24}{366} \qquad \textbf{(E)}\ 366 \times 31 \times 24 \]

Recall that an icosahedron is a $3$-dimensional solid characterized by its $20$ congruent faces, each of which is an equilateral triangle. Determine the number of rigid rotations that preserve the symmetry of the icosahedron. (Each vertex moves to the location of another vertex.)

For a sequence of integers $a_1 < a_2 < \cdot\cdot\cdot < a_n$, a pair $(a_i,a_j)$ where $1 \leq i < j \leq n$ is said to be [i]balanced[/i] if the number $\frac{a_i+a_j}{2}$ belongs to the sequence. For every natural number $n \geq 3$, find the maximum possible number of balanced pairs in a sequence with $n$ numbers.

Consider the sets $A_1=\{1\}$, $A_2=\{2,3,4\}$, $A_3=\{5,6,7,8,9\}$, etc. Let $b_n$ be the arithmetic mean of the smallest and the greatest element in $A_n$. Show that the number $\frac{2000}{b_1-1}+\frac{2000}{b_2-1}+\ldots+\frac{2000}{b_{2000}-1}$ is a prime integer.