Determine the primes $p$ for which the numbers $2\lfloor p/k\rfloor - 1, \ k = 1,2,\ldots, p,$ are all quadratic residues modulo $p.$ [i]Vlad Matei[/i]

$12$ people stand in a row. Each person is given a red shirt or a blue shirt. Every minute, exactly one pair of two people with the same color currently standing next to each other in the row leave. After $6$ minutes, everyone has left. How many ways could the shirts have been assigned initially? [i]Proposed by Evan Chang[/i]

A hunter and an invisible rabbit play a game in the Euclidean plane. The rabbit's starting point, $A_0,$ and the hunter's starting point, $B_0$ are the same. After $n-1$ rounds of the game, the rabbit is at point $A_{n-1}$ and the hunter is at point $B_{n-1}.$ In the $n^{\text{th}}$ round of the game, three things occur in order: [list=i] [*]The rabbit moves invisibly to a point $A_n$ such that the distance between $A_{n-1}$ and $A_n$ is exactly $1.$ [*]A tracking device reports a point $P_n$ to the hunter. The only guarantee provided by the tracking device to the hunter is that the distance between $P_n$ and $A_n$ is at most $1.$ [*]The hunter moves visibly to a point $B_n$ such that the distance between $B_{n-1}$ and $B_n$ is exactly $1.$ [/list] Is it always possible, no matter how the rabbit moves, and no matter what points are reported by the tracking device, for the hunter to choose her moves so that after $10^9$ rounds, she can ensure that the distance between her and the rabbit is at most $100?$ [i]Proposed by Gerhard Woeginger, Austria[/i]

A circle with center $O$ and radius $15$ is given. Let $P$ be a point such that $|OP|=9$. How many of the chords of the circle pass through $P$ and have integer length? $ \textbf{(A)}\ 11 \qquad\textbf{(B)}\ 12 \qquad\textbf{(C)}\ 13 \qquad\textbf{(D)}\ 14 \qquad\textbf{(E)}\ 29 $

Determine the smallest positive integer $\ N $ such that there exists 6 distinct integers $\ a_1, a_2, a_3, a_4, a_5, a_6 > 0 $ satisfying: (i) $\ N = a_1 + a_2 + a_3 + a_4 + a_5 + a_6 $ (ii) $\ N - a_i$ is a perfect square for $\ i = 1,2,3,4,5,6 $.

1. Solve in real numbers x,y,z : $\{\begin{array}{ccc} x^2=yz+1 \\ y^2=zx+2 \\ z^2=xy+4 \\ \end{array}$

Players $A$ and $B$ play a game with $N \geq 2012$ coins and $2012$ boxes arranged around a circle. Initially $A$ distributes the coins among the boxes so that there is at least $1$ coin in each box. Then the two of them make moves in the order $B,A,B,A,\ldots $ by the following rules: [b](a)[/b] On every move of his $B$ passes $1$ coin from every box to an adjacent box. [b](b)[/b] On every move of hers $A$ chooses several coins that were [i]not[/i] involved in $B$'s previous move and are in different boxes. She passes every coin to an adjacent box. Player $A$'s goal is to ensure at least $1$ coin in each box after every move of hers, regardless of how $B$ plays and how many moves are made. Find the least $N$ that enables her to succeed.

Two runners start running along a circular track of unit length from the same starting point and int he same sense, with constant speeds $v_1$ and $v_2$ respectively, where $v_1$ and $v_2$ are two distinct relatively prime natural numbers. They continue running till they simultneously reach the starting point. Prove that (a) at any given time $t$, at least one of the runners is at a distance not more than $\frac{[\frac{v_1 + v_2}{2}]}{v_1 + v_2}$ units from the starting point. (b) there is a time $t$ such that both the runners are at least $\frac{[\frac{v_1 + v_2}{2}]}{v_1 + v_2}$ units away from the starting point. (All disstances are measured along the track). $[x]$ is the greatest integer function.

Five students take a test on which any integer score from $0$ to $100$ inclusive is possible. What is the largest possible difference between the median and the mean of the scores? [i](The median of a set of scores is the middlemost score when the data is arranged in increasing order. It is exactly the middle score when there are an odd number of scores and it is the average of the two middle scores when there are an even number of scores.)[/i]

If $$x+y+z=x^2+y^2+z^2=x^3+y^3+z^3=1 \ \ with \ \ x,y,z\in \mathbb{R},$$ prove that at least one of $x,y,z$ is equal to zero.

Let $H$ be the orthocenter of an acute trangle $ABC$ with circumcircle $\Gamma$. Let $P$ be a point on the arc $BC$ (not containing $A$) of $\Gamma$, and let $M$ be a point on the arc $CA$ (not containing $B$) of $\Gamma$ such that $H$ lies on the segment $PM$. Let $K$ be another point on $\Gamma$ such that $KM$ is parallel to the Simson line of $P$ with respect to triangle $ABC$. Let $Q$ be another point on $\Gamma$ such that $PQ \parallel BC$. Segments $BC$ and $KQ$ intersect at a point $J$. Prove that $\triangle KJM$ is an isosceles triangle.

Two-mutually perpendicular lines $\ell$ and $m$ intersect each other at a point of the circumference of a circle, dividing it into three arcs. A point $M_i$ ($i = 1$,$2$,$3$) is taken on each arc so that the tangent line to the circumference at the point $M_i$ intersects $\ell$ and $m$ in two points at the same distance from $M_i$ (that is $M_i$ is the midpoint of the segment between them). Prove that the triangle $M_1M_2M_3$ is equilateral. (Przhevalsky)

Consider pairs of the sequences of positive real numbers \[a_1\geq a_2\geq a_3\geq\cdots,\qquad b_1\geq b_2\geq b_3\geq\cdots\] and the sums \[A_n = a_1 + \cdots + a_n,\quad B_n = b_1 + \cdots + b_n;\qquad n = 1,2,\ldots.\] For any pair define $c_n = \min\{a_i,b_i\}$ and $C_n = c_1 + \cdots + c_n$, $n=1,2,\ldots$. (1) Does there exist a pair $(a_i)_{i\geq 1}$, $(b_i)_{i\geq 1}$ such that the sequences $(A_n)_{n\geq 1}$ and $(B_n)_{n\geq 1}$ are unbounded while the sequence $(C_n)_{n\geq 1}$ is bounded? (2) Does the answer to question (1) change by assuming additionally that $b_i = 1/i$, $i=1,2,\ldots$? Justify your answer.

At each vertex of a $13$-sided polygon we write one of the numbers $1,2,3,…, 12,13$, without repeating. Then, on each side of the polygon we write the difference of the numbers of the vertices of its ends (the largest minus the smallest). For example, if two consecutive vertices of the polygon have the numbers $2$ and $11$, the number $9$ is written on the side they determine. a) Is it possible to number the vertices of the polygon so that only the numbers $3, 4$ and $5$ are written on the sides? b) Is it possible to number the vertices of the polygon so that only the numbers $3, 4$ and $6$ are written on the sides?

Let $ABC$ be a triangle with $\angle BCA=90^{\circ}$, and let $D$ be the foot of the altitude from $C$. Let $X$ be a point in the interior of the segment $CD$. Let $K$ be the point on the segment $AX$ such that $BK=BC$. Similarly, let $L$ be the point on the segment $BX$ such that $AL=AC$. Let $M$ be the point of intersection of $AL$ and $BK$. Show that $MK=ML$. [i]Proposed by Josef Tkadlec, Czech Republic[/i]