Let $A$ be a set of $20$ distinct positive integers which are all no greater than $397$. Prove that for any positive integer $n$ it is possible to pick four (not necessarily distinct) elements $x_1, x_2, x_3, x_4$ of $A$ satisfying $x_1 \neq x_2$ and $$(x_1-x_2)n\equiv x_3-x_4 \pmod{397}.$$

The radius $r$ of a circle with center at the origin is an odd integer. There is a point ($p^m, q^n$) on the circle, with $p,q$ prime numbers and $m,n$ positive integers. Determine $r$.

$n$ people (with names $1,2,\dots,n$) are around a table. Some of them are friends. At each step 2 friend can change their place. Find a necessary and sufficient condition for friendship relation between them that with these steps we can always reach to all of posiible permutations.

The sum of the roots of the equation $ 4x^2\plus{}5\minus{}8x\equal{}0$ is equal to: $\textbf{(A)}\ 8 \qquad \textbf{(B)}\ -5 \qquad \textbf{(C)}\ -\dfrac{5}{4} \qquad \textbf{(D)}\ -2 \qquad \textbf{(E)}\ \text{None of these}$

Can a regular triangle be placed inside a regular hexagon in such a way that all vertices of the triangle were seen from each vertex of the hexagon? (Point $A$ is seen from $B$, if the segment $AB$ dots not contain internal points of the triangle.)

For any nonnegative integer $r$, let $S_r$ be a function whose domain is the natural numbers that satisfies $$S_r(p^{\alpha}) = \begin{cases} 0\,\, if \,\, if \,\, p \le r \\ p^{{\alpha}-1}(p -r) \,\, if \,\,p > r \end{cases}$$ for all primes $p$ and positive integers ${\alpha}$, and that $S_r(ab) = S_r(a)Sr_(b)$ whenever $a$ and $b$ are relatively prime. Now, suppose there are $n$ squirrels at a party. Each squirrel is labeled with a unique number from the set $\{1, 2,..., n\}$. Two squirrels are friends with each other if and only if the difference between their labels is relatively prime to $n$. For example, if $n = 10$, then the squirrels with labels $3$ and $10$ are friends with each other because $10 - 3 = 7$, and $7$ is relatively prime to $10$. Fix a positive integer $m$. Define a clique of size $m$ to be any set of m squirrels at the party with the property that any two squirrels in the clique are friends with each other. Determine, with proof, a formula (using $S_r$) for the number of cliques of size $m$ at the squirrel party.

Let $f_1(n)$ be the number of divisors that $n$ has, and define $f_k(n)=f_1(f_{k-1}(n))$. Compute the smallest integer $k$ such that $f_k(2013^{2013})=2$.

Let $N=10^6$. For which integer $a$ with $0 \leq a \leq N-1$ is the value of \[\binom{N}{a+1}-\binom{N}{a}\] maximized? [i]Proposed by Lewis Chen[/i]

Let $ ABC$ be an isosceles right triangle and $M$ be the midpoint of its hypotenuse $AB$. Points $D$ and $E$ are taken on the legs $AC$ and $BC$ respectively such that $AD=2DC$ and $BE=2EC$. Lines $AE$ and $DM$ intersect at $F$. Show that $FC$ bisects the $\angle DFE$.

Let $ABC$ be an acute triangle. Let $D$, $E$ and $F$ be the feet of the altitudes from $A$, $B$ and $C$ respectively and let $H$ be the orthocenter of $\triangle ABC$. Let $X$ be an arbitrary point on the circumcircle of $\triangle DEF$ and let the circumcircles of $\triangle EHX$ and $\triangle FHX$ intersect the second time the lines $CF$ and $BE$ second at $Y$ and $Z$, respectively. Prove that the line $YZ$ passes through the midpoint of $BC$.

Find all real numbers a such that all solutions to the quadratic equation $ x^2 \minus{} ax \plus{} a \equal{} 0$ are integers.

On a board there are $n$ nails, each two connected by a rope. Each rope is colored in one of $n$ given distinct colors. For each three distinct colors, there exist three nails connected with ropes of these three colors. a) Can $n$ be $6$ ? b) Can $n$ be $7$ ?

Determine the locus of points, from which the tangent segments to two given circles are equal.

Ten people apply for a job. The manager decides to interview the candidates one by one according to the following conditions: i) the first three candidates will not be employed; ii) from the fourth candidates onwards, if a candidate's comptence surpasses the competence of all those who preceded him, then that candidate is employed; iii) if the first nine candidates are not employed, then the tenth candidate will be employed. We assume that none of the $10$ applicants have the same competence, and these competences can be ranked from the first to tenth. Let $P_k$ represent the probability that the $k$th-ranked applicant in competence is employed. Prove that: i) $P_1>P_2>\ldots>P_8=P_9=P_{10}$; ii) $P_1+P_2+P_3>0.7$ iii) $P_8+P_9+P_{10}\le 0.1$. [i]Su Chun[/i]

As shown in the figure, it is known that $BC= AC$ in $\vartriangle ABC$, $M$ is the midpoint of $AB$, points $D$, $E$ lie on $AB$ such that $\angle DCE= \angle MCB$, the circumscribed circle of $\vartriangle BDC$ and the circumscribed circle of $\vartriangle AEC$ intersect at point $F $(different from point $C$), point $H$ lies on $AB$ such that the straight line $CM$ bisects the line segment $HF$. Let the circumcenters of $\vartriangle HFE$ and $\vartriangle BFM$ be $O_1$, $O_2$ respectively. Prove that $O_1O_2 \perp CF$. [img]https://cdn.artofproblemsolving.com/attachments/8/c/62d4ecbc18458fb4f2bf88258d5024cddbc3b0.jpg[/img]

Show that there exist four integers $a$, $b$, $c$, $d$ whose absolute values are all $>1000000$ and which satisfy $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}+\frac{1}{d}=\frac{1}{abcd}$.

Let $ \triangle{XOY}$ be a right-angled triangle with $ m\angle{XOY}\equal{}90^\circ$. Let $ M$ and $ N$ be the midpoints of legs $ OX$ and $ OY$, respectively. Given that $ XN\equal{}19$ and $ YM\equal{}22$, find $ XY$. $ \textbf{(A)}\ 24 \qquad \textbf{(B)}\ 26 \qquad \textbf{(C)}\ 28 \qquad \textbf{(D)}\ 30 \qquad \textbf{(E)}\ 32$

Let there be a square $ABCD$. Points $E$ and $F$ are on sides $(BC)$ and $(AB)$ such that $BF=CE$. LInes $AE$ and $CF$ intersect in point $G$. Prove that $EF$ and $DG$ are perpendicular.

Prove the inequality: $$\frac{A+a+B+b}{A+a+B+b+c+r}+\frac{B+b+C+c}{B+b+C+c+a+r}>\frac{C+c+A+a}{C+c+A+a+b+r}$$ where $A$, $B$, $C$, $a$, $b$, $c$ and $r$ are positive real numbers

We fill in an $n\times n$ table with real numbers such that the sum of the numbers in each row and each coloumn equals $1$. For which values of $K$ is the following statement true: if the sum of the absolute values of the negative entries in the table is at most $K$, then it's always possible to choose $n$ positive entries of the table such that each row and each coloumn contains exactly one of the chosen entries. [i]Proposed by Dávid Bencsik, Budapest[/i]

In triangle $\triangle ABC$, let $E$ and $F$ be points on sides $AC$ and $AB$, respectively, such that $BFEC$ is cyclic. Let lines $BE$ and $CF$ intersect at point $P$, and $M$ and $N$ be the midpoints of $\overline{BF}$ and $\overline{CE}$, respectively. If $U$ is the foot of the perpendicular from $P$ to $BC$, and the circumcircles of triangles $\triangle BMU$ and $\triangle CNU$ intersect at second point $V$ different from $U$, prove that $A, P,$ and $V$ are collinear. [i]Proposed by Andrew Wen and William Yue[/i]

Determine all the functions $f : \mathbb{R}\rightarrow\mathbb{R}$ that satisfies the following. $f(xf(x)+f(x)f(y)+y-1)=f(xf(x)+xy)+y-1$

A sphere is inscribed in a tetrahedron and each point of contact of the sphere with the four faces is joined to the vertices of the face containing the point. Show that the four sets of three angles so formed are identical.

Find the area of the domain of the system of inequality \[y(y-|x^{2}-5|+4)\leq 0,\ \ y+x^{2}-2x-3\leq 0. \]

There is a rhombus with acute angle $b$ and side $a$. Two parallel lines, the distance between which is equal to the height of the rhombus, intersect all four sides of the rhombus. What can be the sum of the perimeters of two triangles cut off from a rhombus by straight lines? (These two triangles lie outside the strip between parallel lines.)