Let $S$ be a set of $100$ positive integer numbers having the following property: “Among every four numbers of $S$, there is a number which divides each of the other three or there is a number which is equal to the sum of the other three.” Prove that the set $S$ contains a number which divides all other $99$ numbers of $S$. [i]Proposed by Tajikistan[/i]

What is the largest power of 2 that is a divisor of $13^4-11^4$? $\textbf{(A) } 8\qquad\textbf{(B) } 16\qquad\textbf{(C) } 32\qquad\textbf{(D) } 64\qquad \textbf{(E) } 128$

Show that ${2n \choose n} \; \vert \; \text{lcm}(1,2, \cdots, 2n)$ for all positive integers $n$.

Let $n\geq 2$ is positive integer. Find the best constant $C(n)$ such that \[\sum_{i=1}^{n}x_{i}\geq C(n)\sum_{1\leq j<i\leq n}(2x_{i}x_{j}+\sqrt{x_{i}x_{j}})\] is true for all real numbers $x_{i}\in(0,1),i=1,...,n$ for which $(1-x_{i})(1-x_{j})\geq\frac{1}{4},1\leq j<i \leq n.$

Evaluate: $\sum^{\infty}_{k=1} \tfrac{k}{a^{k-1}}$ for all $|a|<1$.

Let $O, M, P$ and $D$ be distinct digits from each other, and different from zero, such that $O < M < P < D$, and the following equation is true: \[ \overline{\text{OMPD}} \times \left( \overline{\text{OM}} - \overline{\text{D}} \right) = \overline{\text{MDDMP}} - \overline{\text{OM}} \] (a) Using estimates, explain why it is impossible for the value of $O$ to be greater than or equal to $3$. (b) Explain why $O$ cannot be equal to $1$. (c) Is it possible for $M$ to be greater than or equal to $5$? Justify. (d) Determine the values of $M$, $P$, and $D$.

A token is placed at each vertex of a regular $2n$-gon. A [i]move[/i] consists in choosing an edge of the $2n$-gon and swapping the two tokens placed at the endpoints of that edge. After a finite number of moves have been performed, it turns out that every two tokens have been swapped exactly once. Prove that some edge has never been chosen.

Find all 4-digit numbers $\overline{abcd}$ that are multiples of $11$, such that the 2-digit number $\overline{ac}$ is a multiple of $7$ and $a + b + c + d = d^2$.

Let $n$ be a positive integer and let $p$ be a prime number. Prove that if $a$, $b$, $c$ are integers (not necessarily positive) satisfying the equations \[ a^n + pb = b^n + pc = c^n + pa\] then $a = b = c$. [i]Proposed by Angelo Di Pasquale, Australia[/i]

Compute the maximum real value of $a$ for which there is an integer $b$ such that $\frac{ab^2}{a+2b} = 2019$. Compute the maximum possible value of $a$.

Find all triples $(x,y,z)$ of positive integers satisfying the system of equations \[\begin{cases} x^2=2(y+z)\\ x^6=y^6+z^6+31(y^2+z^2)\end{cases}\]

Let $\{a_n\}_{n\geq 1}$ be a sequence of real numbers which satisfies the following relation: \[a_{n+1}=10^n a_n^2\] (a) Prove that if $a_1$ is small enough, then $\displaystyle\lim_{n\to\infty} a_n =0$. (b) Find all possible values of $a_1\in \mathbb{R}$, $a_1\geq 0$, such that $\displaystyle\lim_{n\to\infty} a_n =0$.

\[\int_0^{\frac \pi 4} \cot(x)\sqrt{\sin(x)}\,\mathrm dx\] [i]Proposed by Connor Gordon[/i]

Let $u_1, u_2, \dots, u_{2019}$ be real numbers satisfying \[u_{1}+u_{2}+\cdots+u_{2019}=0 \quad \text { and } \quad u_{1}^{2}+u_{2}^{2}+\cdots+u_{2019}^{2}=1.\] Let $a=\min \left(u_{1}, u_{2}, \ldots, u_{2019}\right)$ and $b=\max \left(u_{1}, u_{2}, \ldots, u_{2019}\right)$. Prove that \[ a b \leqslant-\frac{1}{2019}. \]

Given positive integers $n$ and $k \leq n$. Consider an equilateral triangular board with side $n$, which consists of circles: in the first (top) row there is one circle, in the second row there are two circles, $\ldots$ , in the bottom row there are $n$ circles (see the figure below). Let us place checkers on this board so that any line parallel to a side of the triangle (there are $3n$ such lines) contains no more than $k$ checkers. Denote by $T(k, n)$ the largest possible number of checkers in such a placement. [img]https://i.ibb.co/bJjjK1M/Image2.jpg[/img] a) Prove that the following upper bound is true: $$T(k,n) \leq \lfloor \frac{k(2n+1)}{3} \rfloor$$ b) Find $T(1,n)$ and $T(2,n)$ [i]D. Zmiaikou[/i]

Triangles $\triangle ABC$ and $\triangle A'B'C'$ lie in the coordinate plane with vertices $A(0,0)$, $B(0,12)$, $C(16,0)$, $A'(24,18)$, $B'(36,18)$, and $C'(24,2)$. A rotation of $m$ degrees clockwise around the point $(x,y)$, where $0<m<180$, will transform $\triangle ABC$ to $\triangle A'B'C'$. Find $m+x+y$.

For any natural $n$ , define $n!!=(n!)!$ e.g. $3!!=(3!)!=6!=720$. Let $a_1,a_2,...,a_n$ be a positive integer Prove that $$\frac{(a_1+a_2+\cdots+a_n)!!}{a_1!!a_2!!\cdots a_n!!}$$ is an integer. [i](nooonuii)[/i]

Prove that for positive number $t$, the function $F(t)=\int_0^t \frac{\sin x}{1+x^2}dx$ always takes positive number. 1972 Tokyo University of Education entrance exam

$2n$ ($n\ge 2$) teams took part in the football league matches and there were $2n-1$ matchweeks. In each matchweek each team played one match. Any two teams met with each other during the matches in exactly one game. Moreover, in each match one team was the host and the second was a guest. Say a team is [i] traveling[/i], if in any two consecutive matchweeks it was once a host and once a guest. Prove that there are at most two traveling teams.

Let $a_1,a_2,a_3, \cdots $ be distinct positive integers, and $0<c<\frac{3}{2}$ . Prove that : There exist infinitely many positive integers $k$, such that $[a_k,a_{k+1}]>ck $.

Katie and Allie are playing a game. Katie rolls two fair six-sided dice and Allie flips two fair two-sided coins. Katie’s score is equal to the sum of the numbers on the top of the dice. Allie’s score is the product of the values of two coins, where heads is worth $4$ and tails is worth $2.$ What is the probability Katie’s score is strictly greater than Allie’s?

In an acute-angled triangle $ABC$, let $M$ be the midpoint of $AB$ and $P$ the foot of the altitude to $BC$. Prove that if $AC+BC = \sqrt{2}AB$, then the circumcircle of triangle $BMP$ is tangent to $AC$.

In a fish shop with 28 kinds of fish, there are 28 fish sellers. In every seller, there exists only one type of each fish kind, depending on where it comes, Mediterranean or Black Sea. Each of the $k$ people gets exactly one fish from each seller and exactly one fish of each kind. For any two people, there exists a fish kind which they have different types of it (one Mediterranean, one Black Sea). What is the maximum possible number of $k$?

The area of a triangle is determined by the lengths of its sides. Is the volume of a tetrahedron determined by the areas of its faces?

There are $27$ cards, each has some amount of ($1$ or $2$ or $3$) shapes (a circle, a square or a triangle) with some color (white, grey or black) on them. We call a triple of cards a [i]match[/i] such that all of them have the same amount of shapes or distinct amount of shapes, have the same shape or distinct shapes and have the same color or distinct colors. For instance, three cards shown in the figure are a [i]match[/i] be cause they have distinct amount of shapes, distinct shapes but the same color of shapes. What is the maximum number of cards that we can choose such that non of the triples make a [i]match[/i]? [i]Proposed by Amin Bahjati[/i]