Let $a$, $b$, $c$ be positive integers such that $29a + 30b + 31c = 366$. Find $19a + 20b + 21c$.

For every $n\geq 3$, determine all the configurations of $n$ distinct points $X_1,X_2,\ldots,X_n$ in the plane, with the property that for any pair of distinct points $X_i$, $X_j$ there exists a permutation $\sigma$ of the integers $\{1,\ldots,n\}$, such that $\textrm{d}(X_i,X_k) = \textrm{d}(X_j,X_{\sigma(k)})$ for all $1\leq k \leq n$. (We write $\textrm{d}(X,Y)$ to denote the distance between points $X$ and $Y$.) [i](United Kingdom) Luke Betts[/i]

The parabola $P$ has focus $(0,0)$ and goes through the points $(4,3)$ and $(-4,-3)$. For how many points $(x,y)\in P$ with integer coefficients is it true that $|4x+3y|\leq 1000$? $\textbf{(A) }38\qquad \textbf{(B) }40\qquad \textbf{(C) }42\qquad \textbf{(D) }44\qquad \textbf{(E) }46\qquad$

Let $ S$ be any point on the circumscribed circle of $ PQR.$ Then the feet of the perpendiculars from S to the three sides of the triangle lie on the same straight line. Denote this line by $ l(S, PQR).$ Suppose that the hexagon $ ABCDEF$ is inscribed in a circle. Show that the four lines $ l(A,BDF),$ $ l(B,ACE),$ $ l(D,ABF),$ and $ l(E,ABC)$ intersect at one point if and only if $ CDEF$ is a rectangle.

We say that a set $\displaystyle A$ of non-zero vectors from the plane has the property $\displaystyle \left( \mathcal S \right)$ iff it has at least three elements and for all $\displaystyle \overrightarrow u \in A$ there are $\displaystyle \overrightarrow v, \overrightarrow w \in A$ such that $\displaystyle \overrightarrow v \neq \overrightarrow w$ and $\displaystyle \overrightarrow u = \overrightarrow v + \overrightarrow w$. (a) Prove that for all $\displaystyle n \geq 6$ there is a set of $\displaystyle n$ non-zero vectors, which has the property $\displaystyle \left( \mathcal S \right)$. (b) Prove that every finite set of non-zero vectors, which has the property $\displaystyle \left( \mathcal S \right)$, has at least $\displaystyle 6$ elements. [i]Mihai Baluna[/i]

Find all vectors of $n$ real numbers $(x_1,x_2,\ldots,x_n)$ such that \[ \left\{ \begin{array}{ccc} x_1 & = & \dfrac 1{x_2} + \dfrac 1{x_3} + \cdots + \dfrac 1{x_n } \\ x_2 & = & \dfrac 1{x_1} + \dfrac 1{x_3} + \cdots + \dfrac 1{x_n} \\ \ & \cdots & \ \\ x_n & = & \dfrac 1{x_1} + \dfrac 1{x_2} + \cdots + \dfrac 1{x_{n-1}} \end{array} \right. \] [i]Mircea Becheanu[/i]

Let $ABC$ be a triangle. Let $P, Q, R$ be the midpoints of $BC, CA, AB$ respectively. Let $U, V, W$ be the midpoints of $QR, RP, PQ$ respectively. Let $x=AU, y=BV, z=CW$. Prove that there exist a triangle with sides $x, y, z$.

A segment through the focus $F$ of a parabola with vertex $V$ is perpendicular to $\overline{FV}$ and intersects the parabola in points $A$ and $B$. What is $\cos(\angle AVB)$? $ \textbf{(A)}\ -\frac{3\sqrt{5}}{7} \qquad \textbf{(B)}\ -\frac{2\sqrt{5}}{5} \qquad \textbf{(C)}\ -\frac{4}{5} \qquad \textbf{(D)}\ -\frac{3}{5} \qquad \textbf{(E)}\ -\frac{1}{2} $

Vectors coincide with the edges of an arbitrary tetrahedron (possibly non-regular). Is it possible for the sum of these six vectors to equal the zero vector? (Problem from Leningrad)

Let $a,b,c \in \left[ \frac 12, 1 \right]$. Prove that \[ 2 \leq \frac{ a+b}{1+c} + \frac{ b+c}{1+a} + \frac{ c+a}{1+b} \leq 3 . \] [i]selected by Mircea Lascu[/i]

We consider graphs with vertices colored black or white. "Switching" a vertex means: coloring it black if it was formerly white, and coloring it white if it was formerly black. Consider a finite graph with all vertices colored white. Now, we can do the following operation: Switch a vertex and simultaneously switch all of its neighbours (i. e. all vertices connected to this vertex by an edge). Can we, just by performing this operation several times, obtain a graph with all vertices colored black? [It is assumed that our graph has no loops (a [i]loop[/i] means an edge connecting one vertex with itself) and no multiple edges (a [i]multiple edge[/i] means a pair of vertices connected by more than one edge).]

Let $n \geq 2$ be a natural number. We consider a $(2n - 1) \times (2n - 1)$ table.Ana and Bob play the following game: starting with Ana, the two of them alternately color the vertices of the unit squares, Ana with red and Bob with blue, in $2n^2$ rounds. Then, starting with Ana, each one forms a vector with origin at a red point and ending at a blue point, resulting in $2n^2$ vectors with distinct origins and endpoints. If the sum of these vectors is zero, Ana wins. Otherwise, Bob wins. Show that Bob has a winning strategy.

There are $4$ distinct codes used in an intelligence station, one of them applied in each week. No two codes used in two adjacent weeks are the same code. Knowing that code $A$ is used in the first week, find the probability that code $A$ is used in the seventh week.

On a board are drawn the points $A,B,C,D$. Yetti constructs the points $A^\prime,B^\prime,C^\prime,D^\prime$ in the following way: $A^\prime$ is the symmetric of $A$ with respect to $B$, $B^\prime$ is the symmetric of $B$ wrt $C$, $C^\prime$ is the symmetric of $C$ wrt $D$ and $D^\prime$ is the symmetric of $D$ wrt $A$. Suppose that Armpist erases the points $A,B,C,D$. Can Yetti rebuild them? $\star \, \, \star \, \, \star$ [b]Note.[/b] [i]Any similarity to real persons is purely accidental.[/i]

Let $S$ be a set of positive integers, each of them having exactly $100$ digits in base $10$ representation. An element of $S$ is called [i]atom[/i] if it is not divisible by the sum of any two (not necessarily distinct) elements of $S$. If $S$ contains at most $10$ atoms, at most how many elements can $S$ have?

Let $ A$ be a family of proper closed subspaces of the Hilbert space $ H\equal{}l^2$ totally ordered with respect to inclusion (that is , if $ L_1,L_2 \in A$, then either $ L_1\subset L_2$ or $ L_2\subset L_1$). Prove that there exists a vector $ x \in H$ not contaied in any of the subspaces $ L$ belonging to $ A$. [i]B. Szokefalvi Nagy[/i]

Let $n$ be a positive integer. At most how many distinct unit vectors can be selected in $\mathbb{R}^n$ such that from any three of them, at least two are orthogonal?

Say that a polynomial with real coefficients in two variable, $ x,y,$ is [i]balanced[/i] if the average value of the polynomial on each circle centered at the origin is $ 0.$ The balanced polynomials of degree at most $ 2009$ form a vector space $ V$ over $ \mathbb{R}.$ Find the dimension of $ V.$

Polyhedron $ABCDEFG$ has six faces. Face $ABCD$ is a square with $AB=12;$ face $ABFG$ is a trapezoid with $\overline{AB}$ parallel to $\overline{GF},$ $BF=AG=8,$ and $GF=6;$ and face $CDE$ has $CE=DE=14.$ The other three faces are $ADEG, BCEF,$ and $EFG.$ The distance from $E$ to face $ABCD$ is 12. Given that $EG^2=p-q\sqrt{r},$ where $p, q,$ and $r$ are positive integers and $r$ is not divisible by the square of any prime, find $p+q+r.$

A marker is placed at the origin of an integer lattice. Calvin and Hobbes play the following game. Calvin starts the game and each of them takes turns alternatively. At each turn, one can choose two (not necessarily distinct) integers $a, b$, neither of which was chosen earlier by any player and move the marker by $a$ units in the horizontal direction and $b$ units in the vertical direction. Hobbes wins if the marker is back at the origin any time after the first turn. Prove or disprove that Calvin can prevent Hobbes from winning. Note: A move in the horizontal direction by a positive quantity will be towards the right, and by a negative quantity will be towards the left (and similar directions in the vertical case as well).

We are given $30$ non-zero vectors in $3$ dimensional space. Prove that among these there are two such that the angle between them is less than $45^o$.

Let points $A=(0,0,0)$, $B=(1,0,0)$, $C=(0,2,0)$, and $D=(0,0,3)$. Points $E,F,G$, and $H$ are midpoints of line segments $\overline{BD},\overline{AB},\overline{AC}$, and $\overline{DC}$ respectively. What is the area of $EFGH$? $ \textbf{(A)}\ \sqrt2 \qquad\textbf{(B)}\ \frac{2\sqrt5}{3} \qquad\textbf{(C)}\ \frac{3\sqrt5}{4} \qquad\textbf{(D)}\ \sqrt3 \qquad\textbf{(E)}\ \frac{2\sqrt7}{3} $

Suppose that for the linear transformation $T:V \longrightarrow V$ where $V$ is a vector space, there is no trivial subspace $W\subset V$ such that $T(W)\subseteq W$. Prove that for every polynomial $p(x)$, the transformation $p(T)$ is invertible or zero.

Let $ k$ be an integer, $ k \geq 2$, and let $ p_{1},\ p_{2},\ \ldots,\ p_{k}$ be positive reals with $ p_{1} \plus{} p_{2} \plus{} \ldots \plus{} p_{k} \equal{} 1$. Suppose we have a collection $ \left(A_{1,1},\ A_{1,2},\ \ldots,\ A_{1,k}\right)$, $ \left(A_{2,1},\ A_{2,2},\ \ldots,\ A_{2,k}\right)$, $ \ldots$, $ \left(A_{m,1},\ A_{1,2},\ \ldots,\ A_{m,k}\right)$ of $ k$-tuples of finite sets satisfying the following two properties: (i) for every $ i$ and every $ j \neq j^{\prime}$, $ A_{i,j}\cap A_{i,j^{\prime}} \equal{} \emptyset$, and (ii) for every $ i\neq i^{\prime}$ there exist $ j\neq j^{\prime}$ for which $ A_{i,j} \cap A_{i^{\prime},j^{\prime}}\neq\emptyset$. Prove that \[ \sum_{b \equal{} 1}^{m}{\prod_{a \equal{} 1}^{k}{p_{a}^{|A_{b,a}|}}} \leq 1. \]

Points $K,L,M$ on the sides $AB,BC,CA$ respectively of a triangle $ABC$ satisfy $\frac{AK}{KB} = \frac{BL}{LC} = \frac{CM}{MA}$. Show that the triangles $ABC$ and $KLM$ have a common orthocenter if and only if $\triangle ABC$ is equilateral.