Let $n$ be a positive integer number. If $S$ is a finite set of vectors in the plane, let $N(S)$ denote the number of two-element subsets $\{\mathbf{v}, \mathbf{v'}\}$ of $S$ such that \[4\,(\mathbf{v} \cdot \mathbf{v'}) + (|\mathbf{v}|^2 - 1)(|\mathbf{v'}|^2 - 1) < 0. \] Determine the maximum of $N(S)$ when $S$ runs through all $n$-element sets of vectors in the plane. [i]***[/i]

Consider the curve $\Gamma$ defined by the equation $y^2 = x^3 +bx+b^2$, where $b$ is a nonzero rational constant. Inscribe in the curve $\Gamma$ a triangle whose vertices have rational coordinates.

Let $A,B,C$ be three distinct points in space, $(A)$ the sphere with center $A$ and radius $r$. Let $E$ be the set of numbers $R>0$ for which there is a sphere $(H)$ with center $H$ and radius $R$ such that $B$ and $C$ are outside the sphere, and the points of the sphere $(A)$ are strictly inside it. (a) Suppose that $B$ and $C$ are on a line with $A$ and strictly outside $(A)$. Show that $E$ is nonempty and bounded, and determine its supremum in terms of the given data. (b) Find a necessary and sufficient condition for $E$ to be nonempty and bounded (c) Given $r$, compute the smallest possible supremum of $E$, if it exists.

A square is divided into $25$ small squares, equal to each other, drawing lines parallel to the sides of the square. Some are drawn diagonals of small squares so that there are no two diagonals with a common point. What is the maximum number of diagonals that can be traced?

Given a monic quadratic polynomial $Q(x)$, define \[ Q_n (x) = \underbrace{Q(Q(\cdots(Q(x))\cdots))}_{\text{compose $n$ times}} \] for every natural number $n$. Let $a_n$ be the minimum value of the polynomial $Q_n(x)$ for every natural number $n$. It is known that $a_n > 0$ for every natural number $n$ and there exists some natural number $k$ such that $a_k \neq a_{k+1}$. (a) Prove that $a_n < a_{n+1}$ for every natural number $n$. (b) Is it possible to satisfy $a_n < 2021$ for every natural number $n$? [i]Proposed by Fajar Yuliawan[/i]

Let $ABC$ be a right triangle. It is known that there are points $D$ on the side $AC$ and $E$ on the side $BC$ such that $AB = AD = BE$ and $BD$ is perpendicular to $DE$. Calculate the ratios $\frac{AB}{BC}$ and $\frac{BC}{CA}$.

Suppose $P(x)=x^2+Ax+B$ for real $A$ and $B$. If the sum of the roots of $P(2x)$ is $\tfrac 12$ and the product of the roots of $P(3x)$ is $\tfrac 13$, find $A+B$. [i]Proposed by Connor Gordon[/i]

Write the natural numbers from left to right in ascending order. Every minute, we perform an operation. After $m$ minutes, we divide the entire available series into consecutive blocks of $m$ numbers. We leave the first block unchanged and in each of the other blocks we move all the numbers except the first one one place to the left, and move the first one to the end of the block. Prove that throughout the process, each natural number will only move a finite number of times.

The rectangle shown has length $AC=32$, width $AE=20$, and $B$ and $F$ are midpoints of $\overline{AC}$ and $\overline{AE}$, respectively. The area of quadrilateral $ABDF$ is [asy] pair A,B,C,D,EE,F; A = (0,20); B = (16,20); C = (32,20); D = (32,0); EE = (0,0); F = (0,10); draw(A--C--D--EE--cycle); draw(B--D--F); dot(A); dot(B); dot(C); dot(D); dot(EE); dot(F); label("$A$",A,NW); label("$B$",B,N); label("$C$",C,NE); label("$D$",D,SE); label("$E$",EE,SW); label("$F$",F,W); [/asy] $\text{(A)}\ 320 \qquad \text{(B)}\ 325 \qquad \text{(C)}\ 330 \qquad \text{(D)}\ 335 \qquad \text{(E)}\ 340$

Let $n$ be a positive integer. There are $n$ colors available. Each of the integers from $1$ to $1000$ must be painted with one of the $n$ colors such that any two different numbers, if one divides the other, are painted in different colors. Determine the smallest value of $n$ for which this is possible.

A red equilateral triangle $T$ with side length $1$ is drawn on a plane. For a positive real $c$, we place three blue equilateral triangle shaped paper with side length $c$ on a plane to cover $T$ completely. Find the minimum value of $c$. As shown in the picture, it doesn't matter if the blue papers overlap each other or stick out from $T$. Folding or tearing the paper is not allowed.

Four positive integers $x,y,z$ and $t$ satisfy the relations \[ xy - zt = x + y = z + t. \] Is it possible that both $xy$ and $zt$ are perfect squares?

Some of the vertices of a convex $n$-gon are connected by segments, such that any two of them have no common interior point. Prove that, for any $n$ points in general position, there exists a one-to-one correspondence between the points and the vertices of the $n$ gon, such that any two segments between the points, corresponding to the respective segments from the $n$ gon, have no common interior point.

Three points $X, Y,Z$ are on a striaght line such that $XY = 10$ and $XZ = 3$. What is the product of all possible values of $YZ$?

Let be a prime number $ p, $ the quotient ring $ R=\mathbb{Z}[X,Y]/(pX,pY), $ and a prime ideal $ I\supset pA $ that is not maximal. Show that the ring $ \left\{ r/i|r\in R, i\in I \right\} $ is factorial.

Alex dissects a paper triangle into two triangles. Each minute after this he dissects one of obtained triangles into two triangles. After some time (at least one hour) it appeared that all obtained triangles were congruent. Find all initial triangles for which this is possible.

For any positive integer $n$, let $s(n)$ be the sum of its digits, written in decimal base. Prove that for each integer $n \ge 1$ there exists a positive integer $x$ such that the fraction $\frac{x + k}{s(x + k)}$ is not integral, for each integer $k$ with $0 \le k \le n$.

Let $ABC$ be a triangle and its incircle meets $BC, AC, AB$ at $D, E$ and $F$ respectively. Let point $ P $ on the incircle and inside $ \triangle AEF $. Let $ X=PB \cap DF , Y=PC \cap DE, Q=EX \cap FY $. Prove that the points $ A$ and $Q$ lies on $DP$ simultaneously or located opposite sides from $DP$.

$7$ pupils has been given $20$ candies, $5$ candies of $4$ different kinds, so that each pupil has no more then one candy of each kind. Prove that there are two pupils that have three or more pairs of candies of the same kind.

A polynomial $f (x)$ with real coefficients is called [i]completely reducible[/i] if it is a product of at least two non-constant polynomials whose coefficientsare all nonnegative real numbers. Show: If $f (x^{2011})$ is completely reducible, then $f(x)$ is also.

Determine all positive integers $n$ such that $$n\cdot 2^{n-1}+1$$ is a perfect square.

How many ordered pairs of sets $(A, B)$ have the properties: 1. $ A\subseteq \{1, 2, 3, 4, 5, 6\} $ 2. $ B\subseteq\{2, 3, 4, 5, 6, 7, 8\} $ 3. $ A\cap B $ has exactly $3$ elements.

Several jugs (not necessarily of the same size) with juices are placed along a circle. It is allowed to transfuse any part of juice (maybe nothing or the total content) from any jug to the neighboring one on the right, so that the latter one is not overflowed and the sugariness of its content becomes equal to $10\%$. It is known that at the initial moment such transfusion is possible from each jug. Prove that it is possible to perform several transfusions in some order, at most one transfusion from each jug, such that the sugariness of the content of each non-empty jug will become equal to $10\%$. (Sugariness is the percent of sugar in a jug, by weight. Sugar is always uniformly distributed in a jug.)

The positive real numbers $x,y,z$ satisfy $xy+yz+zx=1$. Prove that: $$ 2(x^2+y^2+z^2)+\frac{4}{3}\bigg (\frac{1}{x^2+1}+\frac{1}{y^2+1}+\frac{1}{z^2+1}\bigg) \ge 5 $$

Find all isosceles triangles that cannot be cut into three isosceles triangles with the same sides.