Let $A,B,C$ be points on $[OX$ and $D,E,F$ be points on $[OY$ such that $|OA|=|AB|=|BC|$ and $|OD|=|DE|=|EF|$. If $|OA|>|OD|$, which one below is true? $\textbf{(A)}$ For every $\widehat{XOY}$, $\text{ Area}(AEC)>\text{Area}(DBF)$ $\textbf{(B)}$ For every $\widehat{XOY}$, $\text{ Area}(AEC)=\text{Area}(DBF)$ $\textbf{(C)}$ For every $\widehat{XOY}$, $\text{ Area}(AEC)<\text{Area}(DBF)$ $\textbf{(D)}$ If $m(\widehat{XOY})<45^\circ$ then $\text{Area}(AEC)<\text{Area}(DBF)$, and if $45^\circ < m(\widehat{XOY})<90^\circ$ then $\text{Area}(AEC)>\text{Area}(DBF)$ $\textbf{(E)}$ None of above

Let $\mathcal{C}$ be a family of subsets of $A=\{1,2,\dots,100\}$ satisfying the following two conditions: 1) Every $99$ element subset of $A$ is in $\mathcal{C}.$ 2) For any non empty subset $C\in\mathcal{C}$ there is $c\in C$ such that $C\setminus\{c\}\in \mathcal{C}.$ What is the least possible value of $|\mathcal{C}|$?

Let $x_1<x_2< \ldots <x_{2024}$ be positive integers and let $p_i=\prod_{k=1}^{i}(x_k-\frac{1}{x_k})$ for $i=1,2, \ldots, 2024$. What is the maximal number of positive integers among the $p_i$?

Let $n \geq 1$ be an integer. What is the maximum number of disjoint pairs of elements of the set $\{ 1,2,\ldots , n \}$ such that the sums of the different pairs are different integers not exceeding $n$?

The sides of a triangle have lengths of $ 15$, $ 20$, and $ 25$. Find the length of the shortest altitude. $ \text{(A)}\ 6 \qquad \text{(B)}\ 12 \qquad \text{(C)}\ 12.5 \qquad \text{(D)}\ 13 \qquad \text{(E)}\ 15$

Determine all pairs of prime numbers $(p; q)$ such that $p^2 + 5pq + 4q^2$ is the square of an integer.

Define a sequence $(a_n)$ recursively by $a_1=0, a_2=2, a_3=3$ and $a_n=\max_{0<d<n} a_d \cdot a_{n-d}$ for $n \ge 4$. Determine the prime factorization of $a_{19702020}$.

Suppose that $p,p+d,p+2d,p+3d,p+4d$, and $p+5d$ are six prime numbers, where $p$ and $d$ are positive integers. Show that $d$ must be divisible by $2,3,$ and $5$.

[b]7.[/b] For the differential equation $ \frac{\partial^2 u}{\partial x^2}+\frac{\partial^2 u}{\partial y^2}= 2\frac{\partial^2 u}{\partial x \partial y} $ find all solutions of the form $u(x,y)=f(x)g(y)$. [b](R. 14)[/b]

On $\triangle ABC$, let $M$ the midpoint of $AB$ and $N$ the midpoint of $CM$. Let $X$ a point such that $\angle XMC=\angle MBC$ and $\angle XCM=\angle MCB$ with $X,B$ in opposite sides of line $CM$. Let $\Omega$ the circumcircle of triangle $\triangle AMX$ [b]a)[/b] Show that $CM$ is tangent to $\Omega$ [b]b)[/b] Show that the lines $NX$ and $AC$ meet at $\Omega$

Find all pairs of integers $ (x,y)$ satisfying $ 1\plus{}1996x\plus{}1998y\equal{}xy.$

$ 100\times 19.98\times 1.998\times 1000\equal{} $ $ \text{(A)}\ (1.998)^{2}\qquad\text{(B)}\ (19.98)^{2}\qquad\text{(C)}\ (199.8)^{2}\qquad\text{(D)}\ (1998)^{2}\qquad\text{(E)}\ (19980)^{2} $

Consider a regular 2n-gon $ P$,$A_1,A_2,\cdots ,A_{2n}$ in the plane ,where $n$ is a positive integer . We say that a point $S$ on one of the sides of $P$ can be seen from a point $E$ that is external to $P$ , if the line segment $SE$ contains no other points that lie on the sides of $P$ except $S$ .We color the sides of $P$ in 3 different colors (ignore the vertices of $P$,we consider them colorless), such that every side is colored in exactly one color, and each color is used at least once . Moreover ,from every point in the plane external to $P$ , points of most 2 different colors on $P$ can be seen .Find the number of distinct such colorings of $P$ (two colorings are considered distinct if at least one of sides is colored differently). [i]Proposed by Viktor Simjanoski, Macedonia[/i] JBMO 2017, Q4

The kingdom of Anisotropy consists of $n$ cities. For every two cities there exists exactly one direct one-way road between them. We say that a [i]path from $X$ to $Y$[/i] is a sequence of roads such that one can move from $X$ to $Y$ along this sequence without returning to an already visited city. A collection of paths is called [i]diverse[/i] if no road belongs to two or more paths in the collection. Let $A$ and $B$ be two distinct cities in Anisotropy. Let $N_{AB}$ denote the maximal number of paths in a diverse collection of paths from $A$ to $B$. Similarly, let $N_{BA}$ denote the maximal number of paths in a diverse collection of paths from $B$ to $A$. Prove that the equality $N_{AB} = N_{BA}$ holds if and only if the number of roads going out from $A$ is the same as the number of roads going out from $B$. [i]Proposed by Warut Suksompong, Thailand[/i]

Let $ ABC $ be a triangle and let $ AD, BE, CF $ be cevians of the triangle which are concurrent at $ G $. Prove that if $ CF \cdot BE \ge AF \cdot EC + AE \cdot BF + BC \cdot FE $ then $ AG \le GD $.

Let $a,b\in\mathbb{R},~a>1,~b>0.$ Find the least possible value for $\alpha$ such that :$$(a+b)^x\geq a^x+b,~(\forall)x\geq\alpha.$$

Let $ ABCD$ be a unit square (that is, the labels $ A, B, C, D$ appear in that order around the square). Let $ X$ be a point outside of the square such that the distance from $ X$ to $ AC$ is equal to the distance from $ X$ to $ BD$, and also that $ AX \equal{} \frac {\sqrt {2}}{2}$. Determine the value of $ CX^2$.

Let $a, b_1, b_2, \dots, b_n, c_1, c_2, \dots, c_n$ be real numbers such that \[x^{2n} + ax^{2n - 1} + ax^{2n - 2} + \dots + ax + 1 = \prod_{i = 1}^{n}{(x^2 + b_ix + c_i)}\] Prove that $c_1 = c_2 = \dots = c_n = 1$. As a consequence, all complex zeroes of this polynomial must lie on the unit circle.

A regular hexagon is inscribed in a circle of radius $1$, and all diagonals between vertices that have exactly one vertex between them are drawn. Compute the area of the hexagon enclosed by all of the diagonals.

Let $a$ be a real number. Suppose the function $f(x) = \frac{a}{x-1} + \frac{1}{x-2} + \frac{1}{x-6}$ defined in the interval $3 < x < 5$ attains its maximum at $x=4$. Find the value of $a.$

Sonia has $10$, $15$ and $20$ cent stamps with total face value of $\$5$. She has $30$ stamps altogether. Prove that she has more $20$ cent stamps than $10$ cent stamps.

Let n be a positive integer. Find all complex numbers $x_{1}$, $x_{2}$, ..., $x_{n}$ satisfying the following system of equations: $x_{1}+2x_{2}+...+nx_{n}=0$, $x_{1}^{2}+2x_{2}^{2}+...+nx_{n}^{2}=0$, ... $x_{1}^{n}+2x_{2}^{n}+...+nx_{n}^{n}=0$.

Find all functions $f:\mathbb{N} \rightarrow \mathbb{N}$, such that $f(a)+f(b)+ab \mid a^2f(a)+b^2f(b)+f(a)f(b)$ for all positive integers $a,b$.

A quadruple $(p, a, b, c)$ of positive integers is called a Leiden quadruple if - $p$ is an odd prime number, - $a, b$, and $c$ are distinct and - $ab + 1, bc + 1$ and $ca + 1$ are divisible by $p$. a) Prove that for every Leiden quadruple $(p, a, b, c)$ we have $p + 2 \le \frac{a+b+c}{3}$ . b) Determine all numbers $p$ for which a Leiden quadruple $(p, a, b, c)$ exists with $p + 2 = \frac{a+b+c}{3} $

A $2 \times 2$ square was cut out of a sheet of grid paper. Using only a ruler without divisions and without going beyond the square, divide the diagonal of the square into $6$ equal parts.