$d$ and $n$ are positive integers such that $d \mid n$. The n-number sets $(x_1, x_2, \cdots x_n)$ satisfy the following condition: (1) $0 \leq x_1 \leq x_2 \leq \cdots \leq x_n \leq n$ (2) $d \mid (x_1+x_2+ \cdots x_n)$ Prove that in all the n-number sets that meet the conditions, there are exactly half satisfy $x_n=n$.

Let $ABCD$ be a quadrilateral inscribed in a unit circle with center $O$. Suppose that $\angle AOB = \angle COD = 135^\circ$, $BC=1$. Let $B^\prime$ and $C^\prime$ be the reflections of $A$ across $BO$ and $CO$ respectively. Let $H_1$ and $H_2$ be the orthocenters of $AB^\prime C^\prime$ and $BCD$, respectively. If $M$ is the midpoint of $OH_1$, and $O^\prime$ is the reflection of $O$ about the midpoint of $MH_2$, compute $OO^\prime$.

A rectangle is decomposed by $6$ vertical lines and $6$ horizontal lines in the $49$ small rectangles (see figure). The perimeter of each small rectangle is known to be a whole number of meters. In this case, will the perimeter of the large rectangle be a whole number of meters? [asy] unitsize(0.8 cm); draw((0,0)--(8.6,0)--(8.6,4.2)--(0,4.2)--cycle, linewidth(1.5*bp)); draw((0.7,0)--(0.7,4.2)); draw((1.2,0)--(1.2,4.2)); draw((4.1,0)--(4.1,4.2)); draw((5.6,0)--(5.6,4.2)); draw((6.0,0)--(6.0,4.2)); draw((7.4,0)--(7.4,4.2)); draw((0,0.4)--(8.6,0.4)); draw((0,1.0)--(8.6,1.0)); draw((0,1.5)--(8.6,1.5)); draw((0,2.5)--(8.6,2.5)); draw((0,3.1)--(8.6,3.1)); draw((0,3.5)--(8.6,3.5)); [/asy]

The real numbers $a_0,a_1,a_2,\ldots$ satisfy $1=a_0\le a_1\le a_2\le\ldots. b_1,b_2,b_3,\ldots$ are defined by $b_n=\sum_{k=1}^n{1-{a_{k-1}\over a_k}\over\sqrt a_k}$. [b]a.)[/b] Prove that $0\le b_n<2$. [b]b.)[/b] Given $c$ satisfying $0\le c<2$, prove that we can find $a_n$ so that $b_n>c$ for all sufficiently large $n$.

A line meets a segment $AB$ at point $C$. Which is the maximal number of points $X$ of this line such that one of angles $AXC$ and $BXC$ is equlal to a half of the second one?

Let $f(x)=\frac{\sqrt{2+\sqrt2}x+\sqrt{2-\sqrt2}}{-\sqrt{2-\sqrt2}x+\sqrt{2+\sqrt2}}$. Find $\underbrace{f(f(\cdots f}_{1987\text{ times}}(x)\cdots))$.

Let $x_1,x_2,...,x_n \in [0;1]$ prove that $x_1(1-x_2)+x_2(1-x_3)+...+x_{n-1}(1-x_n)+x_n(1-x_1) \leq [\frac{n}{2}]$

The area of the rectangular region is [asy] draw((0,0)--(4,0)--(4,2.2)--(0,2.2)--cycle,linewidth(.5 mm)); label(".22 m",(4,1.1),E); label(".4 m",(2,0),S); [/asy] $\text{(A)}\ \text{.088 m}^2 \qquad \text{(B)}\ \text{.62 m}^2 \qquad \text{(C)}\ \text{.88 m}^2 \qquad \text{(D)}\ \text{1.24 m}^2 \qquad \text{(E)}\ \text{4.22 m}^2$

Solve the following system of equations in real numbers: $$\left\{\begin{array}{l}x^2=y^2+z^2,\\x^{2024}=y^{2024}+z^{2024},\\x^{2025}=y^{2025}+z^{2025}.\end{array}\right.$$ [i]Proposed by Mykhailo Shtandenko, Anton Trygub, Bogdan Rublov[/i]

In the quadrilateral $ABCD$ it is known that $ABC + DBC = 180^o$ and $ADC + BDC = 180^o$. Prove that the center of the circle circumscribed around the triangle $BCD$ lies on the diagonal $AC$.

Determine the least $n\in\mathbb{N}$ such that $n!=1\cdot 2\cdot 3\cdots (n-1)\cdot n$ has at least $2010$ positive factors.

Let $ p(x) $ be a quadratic polynomial for which : \[ |p(x)| \leq 1 \qquad \forall x \in \{-1,0,1\} \] Prove that: \[ \ |p(x)|\leq\frac{5}{4} \qquad \forall x \in [-1,1]\]

A round robin tournament is held with $2016$ participants. Each round, after seeing the results from the previous round, the tournament organizer chooses two players to play a game with each other that will result in a win for one of the players and a loss for the other. The tournament organizer wants each person to have a different total number of wins at the end of $k$ rounds. Find the minimum possible value of $k$ for which this can always be guaranteed. [i]Proposed by Nathan Ramesh

Given a $10 \times 10$ chessboard colored as black-and-white alternately. Prove that for any $46$ unit squares without common edges, there are at least $30$ unit squares with the same color.

In the coordinate plane, find the area of the region bounded by the curve $ C: y\equal{}\frac{x\plus{}1}{x^2\plus{}1}$ and the line $ L: y\equal{}1$.

Three cyclists started simultaneously on three parallel straight paths (at the time of the start, the athletes were on the same straight line). Cyclists travel at constant speeds. $1$ second after the start, the triangle formed by the cyclists had an area of ​​$5$ m$^2$. What area will such a triangle have in $10$ seconds after the start?

It is given that $x = -2272$, $y = 10^3+10^2c+10b+a$, and $z = 1$ satisfy the equation $ax + by + cz = 1$, where $a, b, c$ are positive integers with $a < b < c$. Find $y.$

Equilateral triangle $ABC$ has circumcircle $\Omega$. Points $D$ and $E$ are chosen on minor arcs $AB$ and $AC$ of $\Omega$ respectively such that $BC=DE$. Given that triangle $ABE$ has area $3$ and triangle $ACD$ has area $4$, find the area of triangle $ABC$.

For any positive integer $x$, let $f(x)=x^x$. Suppose that $n$ is a positive integer such that there exists a positive integer $m$ with $m \neq 1$ such that $f(f(f(m)))=m^{m^{n+2020}}$. Compute the smallest possible value of $n$. [i]Proposed by Luke Robitaille[/i]

Let $n$ be a positive integer and let $x$ and $y$ be positive divisors of $2n^2-1$. Prove that $x+y$ is not divisible by $2n+1$.

Find all positive integers $p,q,r,s>1$ such that $$p!+q!+r!=2^s.$$

$S_1,S_2,\ldots,S_n$ are subsets of $\{1,2,\ldots,10000\}$ which satisfy that, whenever $|S_i| > |S_j|$, the sum of all elements in $S_i$ is less than the sum of all elements in $S_j$. Let $m$ be the maximum number of distinct values among $|S_1|,\ldots,|S_n|$. Find $\left\lfloor\frac{m}{100}\right\rfloor$.

1) Is it possible to place five circles on the plane in such way that each circle has exactly 5 common points with other circles? 2) Is it possible to place five circles on the plane in such way that each circle has exactly 6 common points with other circles? 3) Is it possible to place five circles on the plane in such way that each circle has exactly 7 common points with other circles?

Anna and Brian play a game where they put the domino tiles (of size $2 \times 1$) in a boards composed of $n \times 1$ boxes. Tiles must be placed so that they cover exactly two boxes. Players take turnslaying each tile and the one laying last tile wins. They play once for each $n$, where $n = 2, 3,\dots,2007$. Show that Anna wins at least $1505$ of the games if she always starts first and they both always play optimally, ie if they do their best to win in every move.

Show: For all real numbers $ a,b,c$ with $ 0<a,b,c<1$ is: \[ \sqrt{a^2bc\plus{}ab^2c\plus{}abc^2}\plus{}\sqrt{(1\minus{}a)^2(1\minus{}b)(1\minus{}c)\plus{}(1\minus{}a)(1\minus{}b)^2(1\minus{}c)\plus{}(1\minus{}a)(1\minus{}b)(1\minus{}c)^2}<\sqrt{3}.\]