On the name day of a man there are $5$ people. The men observed that of any $3$ people there are $2$ that knows each other. Prove that the man may order his guests around circular table in such way that every man have on its both side people that he knows. [i]N. Nenov, N. Hazhiivanov[/i]

Two medians of a triangle are perpendicular. Prove that the medians of the triangle are the sides of a right-angled triangle.

A set $S$ of natural numbers is called [i]good[/i], if for each element $x \in S, x$ does not divide the sum of the remaining numbers in $S$. Find the maximal possible number of elements of a [i]good [/i]set which is a subset of the set $A = \{1,2, 3, ...,63\}$.

A game is played with two heaps of $p$ and $q$ stones. Two players alternate playing, with $A$ starting. A player in turn takes away one heap and divides the other heap into two smaller ones. A player who cannot perform a legal move loses the game. For which values of $p$ and $q$ can $A$ force a victory?

Find all the prime number $p, q$ and r with $p < q < r$, such that $25pq + r = 2004$ and $pqr + 1 $ is a perfect square.

Rudolph bikes at a constant rate and stops for a five-minute break at the end of every mile. Jennifer bikes at a constant rate which is three-quarters the rate that Rudolph bikes, but Jennifer takes a five-minute break at the end of every two miles. Jennifer and Rudolph begin biking at the same time and arrive at the $ 50$-mile mark at exactly the same time. How many minutes has it taken them?

Let $x_1$, $x_2$, and $x_3$ be the roots of the polynomial $x^3+3x+1$. There are relatively prime positive integers $m$ and $n$ such that $\tfrac{m}{n}=\tfrac{x_1^2}{(5x_2+1)(5x_3+1)}+\tfrac{x_2^2}{(5x_1+1)(5x_3+1)}+\tfrac{x_3^2}{(5x_1+1)(5x_2+1)}$. Find $m+n$.

Let $s \geq 3$ be a given integer. A sequence $K_n$ of circles and a sequence $W_n$ of convex $s$-gons satisfy: \[ K_n \supset W_n \supset K_{n+1} \] for all $n = 1, 2, ...$ Prove that the sequence of the radii of the circles $K_n$ converges to zero.

Consider an undirected, connected graph $G$ with vertex set $\{v_1,v_2,\ldots, v_6\}$. Starting at the vertex $v_1$, an ant uses a DFS algorithm to traverse through $G$ under the condition that if there are multiple unvisited neighbors of some vertex, the ant chooses the $v_i$ with smallest $i$. How many possible graphs $G$ are there satisfying the following property: for each $1\leq i\leq 6$, the vertex $v_i$ is the $i^{\text{th}}$ new vertex the ant traverses?

A train is going up a hill with vertical velocity given as a function of $t$ by $\frac{1}{1 - t^4}$ , where $t$ is between $[0, 1)$. Determine its height as a function of $t$.

[asy] size(200); pair A=(-2,0),B,C=(-1,0),D=(1,0),EE,O=(0,0); draw(arc(O,1, 0, 180)); EE=midpoint(arc(O,1, 0, 90)); draw(A--EE); draw(A--D); B=intersectionpoint(arc(O,1, 180, 0),EE--A); draw(O--EE); label("$A$",A,W); label("$B$",B,NW); label("$C$",C,S);label("$D$",D,E);label("$E$",EE,NE);label("$O$",O,S);label("$45^\circ$",(0.25,0.1),fontsize(10pt)); //Credit to TheMaskedMagician for the diagram [/asy] In the adjoining figure, $CD$ is the diameter of a semi-circle with center $O$. Point $A$ lies on the extension of $DC$ past $C$; point $E$ lies on the semi-circle, and $B$ is the point of intersection (distinct from $E$ ) of line segment $AE$ with the semi-circle. If length $AB$ equals length $OD$, and the measure of $\measuredangle EOD$ is $45^\circ$, then the measure of $\measuredangle BAO$ is $\textbf{(A) }10^\circ\qquad\textbf{(B) }15^\circ\qquad\textbf{(C) }20^\circ\qquad\textbf{(D) }25^\circ\qquad\textbf{(E) }30^\circ$

A 3-dimensional cross is made up of 7 cubes, one central cube and 6 cubes that share a face with it. The cross is inscribed in a circle with radius 1. What's its volume?

The cells of the $9 \times 9$ table are colored black and white. It turned out, that there were $k$ rows, in each of which there are more black cells than white ones white, and there were $k$ columns, each of which contained more than black. At what highest $ k$ is this possible?

Let $I$ be the incenter and $AB$ the shortest side of the triangle $ABC$. The circle centered at $I$ passing through $C$ intersects the ray $AB$ in $P$ and the ray $BA$ in $Q$. Let $D$ be the point of tangency of the $A$-excircle of the triangle $ABC$ with the side $BC$. Let $E$ be the reflection of $C$ with respect to the point $D$. Prove that $PE\perp CQ$.

Let $S_0=0$ and let $S_k$ equal $a_1+2a_2+\ldots+ka_k$ for $k\geq 1$. Define $a_i$ to be $1$ if $S_{i-1}<i$ and $-1$ if $S_{i-1}\geq i$. What is the largest $k\leq 2010$ such that $S_k=0$?

A convex $n$-vertex polygon is partitioned into triangles by nonintersecting diagonals . The following operation, called perestroyka (=reconstruction) , is allowed: two triangles $ABD$ and $BCD$ with a common side may be replaced by the triangles $ABC$ and $ACD$. By $P(n)$ denote the smallest number of perestroykas needed to transform any partitioning into any other one. Prove that (a) $P ( n ) \ge n - 3$ (b) $P (n) \le 2n - 7$ (c) $P(n) \le 2n - 10$ if $n \ge 13$ . ( D.Fomin , based on ideas of W. Thurston , D . Sleator, R. Tarjan)

Given a triangle$ABC$ with $AB<BC<AC$ inscribed in circle $(c)$. The circle $c(A,AB)$ (with center $A$ and radius $AB$) interects the line $BC$ at point $D$ and the circle $(c)$ at point $H$. The circle $c(A,AC)$ (with center $A$ and radius $AC$) interects the line $BC$ at point $Z$ and the circle $(c)$ at point $E$. Lines $ZH$ and $ED$ intersect at point $T$. Prove that the circumscribed circles of triangles $TDZ$ and $TEH$ are equal.

$ABCDE$ is a regular pentagon. What is the degree measure of the acute angle at the intersection of line segments $AC$ and $BD$?

The audience chooses two of twenty-nine cards, numbered from $1$ to $29$ respectively. The assistant of a magician chooses two of the remaining twenty-seven cards, and asks a member of the audience to take them to the magician, who is in another room. The two cards are presented to the magician in an arbitrary order. By an arrangement with the assistant beforehand, the magician is able to deduce which two cards the audience has chosen only from the two cards he receives. Explain how this may be done.

In an acute triangle $ABC$, $\angle C = 60^o$. If $AA'$ and $BB'$ are two of the altitudes and $C_1$ is the midpoint of $AB$, prove that triangle $C_1A'B'$ is equilateral.

Calculate the exact value of the series $\sum _{n=2} ^\infty \log (n^3 +1) - \log (n^3 - 1)$ and provide justification.

Solve the equation $$\frac{\pi-2}{2} + \frac{2}{1+\sin (2\sqrt{x})}+arccos(x^3-8x-1)=tg^2\sqrt{x}- \sqrt{x^4+x^3-5x^2-8x-24}$$

Mr. Rose, Mr. Stein, and Mr. Schwartz start at the same point around a circular track and run clockwise. Mr. Stein completes each lap in $6$ minutes, Mr. Rose in $10$ minutes, and Mr. Schwartz in $18$ minutes. How many minutes after the start of the race are the runners at identical points around the track (that is, they are aligned and are on the same side of the track) for the first time?

Let $ABC$ be an acute triangle with $D, E, F$ the feet of the altitudes lying on $BC, CA, AB$ respectively. One of the intersection points of the line $EF$ and the circumcircle is $P.$ The lines $BP$ and $DF$ meet at point $Q.$ Prove that $AP = AQ.$ [i]Proposed by Christopher Bradley, United Kingdom[/i]

Postive real numbers $a, b, c$ satisfy $abc=1$. Show that $$\frac{a^3+a^2}{1+bc}+\frac{b^3+b^2}{1+ca}+\frac{c^3+c^2}{1+ab}\geq3.$$