Find the smallest positive number $\lambda$, such that for any $12$ points on the plane $P_1,P_2,\ldots,P_{12}$(can overlap), if the distance between any two of them does not exceed $1$, then $\sum_{1\le i<j\le 12} |P_iP_j|^2\le \lambda$.

Find all polynomials $P$ with real coefficients such that for all $x, y ,z \in R$, $$P(x)+P(y)+P(z)+P(x+y+z)=P(x+y)+P(y+z)+P(z+x)$$

Consider a pool table with the shape of an equilateral triangle. A ball of negligible size is initially placed at the center of the table. After it has been hit, it will keep moving in the direction it was hit towards and bounce off any edges with perfect symmetry. If it eventually reaches the midpoint of any edge, we mark the midpoint of the entire route that the ball has travelled through. Repeating this experiment, how many points can we mark at most? [img]https://cdn.artofproblemsolving.com/attachments/5/d/3ae7aad4271b9a417826f3bc8dd7b43aeca5d4.png[/img]

Find all functions $f:\mathbb{R}\backslash\{0\}\rightarrow\mathbb{R}$ for which $xf(xy) + f(-y) = xf(x)$ for all non-zero real numbers $x, y$.

Two players in turn paint cells of the $7\times7$ table each using own color. A player can't paint a cell if its row or its column contains a cell painted by the other player. The game stops when one of the players can't make his turn. What maximal number of the cells can remain unpainted when the game stops?

Find all triples $(a, b, c)$ of positive integers for which $\frac{32a + 3b + 48c}{4abc}$ is also an integer.

Find all positive $r{}$ satisfying the following condition: For any $d > 0$, there exist two circles of radius $r{}$ in the plane that do not contain lattice points strictly inside them and such that the distance between their centers is $d{}$.

Determine the minimum value of prime $p> 3$ for which there is no natural number $n> 0$ such that $2^n+3^n\equiv 0\pmod{p} $.

Consider a square $ABCD$ with side length $4$ and label the midpoint of side $BC$ as $M$. Let $X$ be the point along $AM$ obtained by dropping a perpendicular from $D$ onto $AM$. Compute the product of the lengths $XC$ and $MD$.

Let $D$ and $E$ be points on the sides $BC$ and $AC$ of the triangle $\triangle ABC$, respectively. The circumcircle of $\triangle ADC$ meets the circumcircle of $\triangle BCE$ for the second time at $F$. The line $FE$ meets the line $AD$ at $G$, while the line $FD$ meets the line $BE$ at $H$. Prove that the lines $CF$, $AH$ and $BG$ pass through the same point. [i]Authored by Petar Filipovski[/i]

There are $11$ members in the competetion committee. The problem set is kept in a safe having several locks. The committee members have been provided with keys in such a way that every six members can open the safe, but no five members can do that. What is the smallest possible number of locks, and how many keys are needed in that case?

Merlin summons the $n$ knights of Camelot for a conference. Each day, he assigns them to the $n$ seats at the Round Table. From the second day on, any two neighbours may interchange their seats if they were not neighbours on the first day. The knights try to sit in some cyclic order which has already occurred before on an earlier day. If they succeed, then the conference comes to an end when the day is over. What is the maximum number of days for which Merlin can guarantee that the conference will last?

Consider systems of three linear equations with unknowns $x,$ $y,$ and $z,$ \begin{align*} a_1 x + b_1 y + c_1 z = 0 \\ a_2 x + b_2 y + c_2 z = 0 \\ a_3 x + b_3 y + c_3 z = 0 \end{align*} where each of the coefficients is either $0$ or $1$ and the system has a solution other than $x = y = z = 0.$ For example, one such system is $\{1x + 1y + 0z = 0, 0x + 1y + 1z = 0, 0x + 0y + 0z = 0\}$ with a nonzero solution of $\{x, y, z\} = \{1, -1, 1\}.$ How many such systems are there? (The equations in a system need not be distinct, and two systems containing the same equations in a different order are considered different.) $\textbf{(A) } 302 \qquad \textbf{(B) } 338 \qquad \textbf{(C) } 340 \qquad \textbf{(D) } 343 \qquad \textbf{(E) } 344$

Consider the cube with the vertices at the points $(\pm 1, \pm 1, \pm 1)$. Let $V_1,...,V_{95}$ be arbitrary points within this cube. Denote $v_i = \overrightarrow{OV_i}$, where $O = (0,0,0)$ is the origin. Consider the $2^{95}$ vectors of the form $s_1v_1 + s_2v_2 +...+ s_{95}v_{95}$, where $s_i = \pm 1$. (a) If $d = 48$, prove that among these vectors there is a vector $w = (a, b, c)$ such that $a^2 + b^2 + c^2 \le 48$. (b) Find a smaller $d$ (the smaller, the better) with the same property.

$n>1$ is an integer. Let real number $x>1$ satisfy $$x^{101}-nx^{100}+nx-1=0.$$ Prove that for any real $0<a<b<1$, there exists a positive integer $m$ so that $a<\{x^m\}<b.$ [i]Proposed by Chenjie Yu[/i]

$N$ oligarchs built a country with $N$ cities with each one of them owning one city. In addition, each oligarch built some roads such that the maximal amount of roads an oligarch can build between two cities is $1$ (note that there can be more than $1$ road going through two cities, but they would belong to different oligarchs). A total of $d$ roads were built. Some oligarchs wanted to create a corporation by combining their cities and roads so that from any city of the corporation you can go to any city of the corporation using only corporation roads (roads can go to other cities outside corporation) but it turned out that no group of less than $N$ oligarchs can create a corporation. What is the maximal amount that $d$ can have?

In $\Delta ABC$, $AD \perp BC$ at $D$. $E,F$ lie on line $AB$, such that $BD=BE=BF$. Let $I,J$ be the incenter and $A$-excenter. Prove that there exist two points $P,Q$ on the circumcircle of $\Delta ABC$ , such that $PB=QC$, and $\Delta PEI \sim \Delta QFJ$ .

Find the number of ordered quadruplets $(a_1,a_2,a_3,a_4)$ of integers, for which $a_1\geq 1$, $a_2\geq 2$, $a_3\geq 3$, and $-10\leq a_4\leq 10$ and $a_1+a_2+a_3+a_4=2011$ .

Find all real solutions to the following system of equations. Carefully justify your answer. \[ \left\{ \begin{array}{c} \displaystyle\frac{4x^2}{1+4x^2} = y \\ \\ \displaystyle\frac{4y^2}{1+4y^2} = z \\ \\ \displaystyle\frac{4z^2}{1+4z^2} = x \end{array} \right. \]

A sequence $ (S_n), n \geq 1$ of sets of natural numbers with $ S_1 = \{1\}, S_2 = \{2\}$ and \[{ S_{n + 1} = \{k \in }\mathbb{N}|k - 1 \in S_n \text{ XOR } k \in S_{n - 1}\}. \] Determine $ S_{1024}.$

The sets of rational numbers $A = \{a_1, \dots, a_5\}$ and $B = \{b_1, \dots, b_5\}$ both contain $0$ and satisfy the condition that $$ \{a_i + b_j\}_{i,j} = \{0, 1, 2, \dots, 23, 24\}. $$ Determine these sets. (The set $\{a_i + b_j\}_{i,j}$ consists of all possible sums between an element of $A$ and an element of $B$)

Percy buys $3$ apples for $6$ dollars, $4$ pears for $16$ dollars, and $1$ watermelon for $5$ dollars. Assuming the rates stay the same, how much would it cost to buy $10$ apples, $3$ pears, and $2$ watermelons? $\textbf{(A) } 38\qquad\textbf{(B) } 39\qquad\textbf{(C) } 40\qquad\textbf{(D) } 41\qquad\textbf{(E) } 42$

Prove that the equation $x^{19} + x^{17} = x^{16 }+ x^7 + a$ for any $a \in R$ has at least two imaginary roots

Consider a regular $24$-gon $\mathcal{P}.$ A quadrilateral is said to be inscribed in $\mathcal{P}$ if its vertices are among those of $\mathcal{P}.$ We consider two inscribed quadrilaterals equivalent if one can be obtained from the other via a rotation about the center of $\mathcal{P}.$ How many distinct (i.e. not equivalent) quadrilaterals can be inscribed in $\mathcal{P}$?

Let $ABC$ be a triangle with $\angle A,\angle B,\angle C <120^{\circ}$. Prove that: there is exactly one point $T$ inside $\triangle ABC$ such that $\angle BTC=\angle CTA=\angle ATB=120^{\circ}$. ($T$ is called [i]Fermat-Torricelli[/i] point of $\triangle ABC$)