Let $ABCDE$ be a convex pentagon such that $\angle ABC = \angle AED = 90^\circ$. Suppose that the midpoint of $CD$ is the circumcenter of triangle $ABE$. Let $O$ be the circumcenter of triangle $ACD$. Prove that line $AO$ passes through the midpoint of segment $BE$.

Let $ABC$ be a triangle and $H$ and $D$ be the feet of the height and bisector relative to $A$ in $BC$, respectively. Let $E$ be the intersection of the tangent to the circumcircle of $ABC$ by $A$ with $BC$ and $M$ be the midpoint of $AD$. Finally, let $r$ be the line perpendicular to $BC$ that passes through $M$. Show that $r$ is tangent to the circumcircle of $AHE$.

Calculate: [b]a)[/b] $ \int \frac{1-x^2-x^6+x^8}{1+x^{10}} dx $ [b]b)[/b] $ \int\frac{x^{n-1}+x^{5n-1}}{1+x^{6n}} dx $ [i]Dumitru Acu[/i]

The inscribed circle inside triangle $ABC$ intersects side $AB$ in $D$. The inscribed circle inside triangle $ADC$ intersects sides $AD$ in $P$ and $AC$ in $Q$.The inscribed circle inside triangle $BDC$ intersects sides $BC$ in $M$ and $BD$ in $N$. Prove that $P , Q, M, N$ are cyclic.

For positive integers $n,d$, define $n \% d$ to be the unique value of the positive integer $r < d$ such that $n = qd + r$, for some positive integer $q$. What is the smallest value of $n$ not divisible by $5,7,11,13$ for which $n^2 \% 5 < n^2 \% 7 < n^2 \% 11 < n^2 \% 13$?

Find the sum of all $x$ from $2$ to $1000$ inclusive such that $$\prod_{n=2}^x \log_{n^n}(n+1)^{n+2}$$ is an integer. [i]Proposed by Deyuan Li and Andrew Milas[/i]

Given an acute triangle $ABC$. with $H$ as its orthocenter, lines $\ell_1$ and $\ell_2$ go through $H$ and are perpendicular to each other. Line $\ell_1$ cuts $BC$ and the extension of $AB$ on $D$ and $Z$ respectively. Whereas line $\ell_2$ cuts $BC$ and the extension of $AC$ on $E$ and $X$ respectively. If the line through $D$ and parallel to $AC$ and the line through $E$ parallel to $AB$ intersects at $Y$, prove that $X,Y,Z$ are collinear.

Let $S$ be the set of all tetrahedra which satisfy: (1) the base has area $1$, (2) the total face area is $4$, and (3) the angles between the base and the other three faces are all equal. Find the element of $S$ which has the largest volume.

Celeste has an unlimited amount of each type of $n$ types of candy, numerated type 1, type 2, ... type n. Initially she takes $m>0$ candy pieces and places them in a row on a table. Then, she chooses one of the following operations (if available) and executes it: $1.$ She eats a candy of type $k$, and in its position in the row she places one candy type $k-1$ followed by one candy type $k+1$ (we consider type $n+1$ to be type 1, and type 0 to be type $n$). $2.$ She chooses two consecutive candies which are the same type, and eats them. Find all positive integers $n$ for which Celeste can leave the table empty for any value of $m$ and any configuration of candies on the table. $\textit{Proposed by Federico Bach and Santiago Rodriguez, Colombia}$

Let $ABCD$ be a cyclic quadrilateral. Assume that the points $Q, A, B, P$ are collinear in this order, in such a way that the line $AC$ is tangent to the circle $ADQ$, and the line $BD$ is tangent to the circle $BCP$. Let $M$ and $N$ be the midpoints of segments $BC$ and $AD$, respectively. Prove that the following three lines are concurrent: line $CD$, the tangent of circle $ANQ$ at point $A$, and the tangent to circle $BMP$ at point $B$.

Let $S$ be the sum of all positive integers that can be expressed in the form $2^a \cdot 3^b \cdot 5^c$, where $a$, $b$, $c$ are positive integers that satisfy $a+b+c=10$. Find the remainder when $S$ is divided by $1001$. [i]Proposed by Michael Ren[/i]

A [i]trifecta[/i] is an ordered triple of positive integers $(a, b, c)$ with $a < b < c$ such that $a$ divides $b$, $b$ divides $c$, and $c$ divides $ab$. What is the largest possible sum $a + b + c$ over all trifectas of three-digit integers?

If $0<a<b$, given two fixed points $A(a,0),B(b,0)$. Draw lines $l$ passes $A$, $m$ passes $B$. They have four different intersections with parabola $y^2=x$. If the four points are concyclic, find the path of $P(P=l\cap m)$.

Nondegenerate $ \triangle ABC$ has integer side lengths, $ BD$ is an angle bisector, $ AD \equal{} 3$, and $ DC \equal{} 8$. What is the smallest possible value of the perimeter? $ \textbf{(A)}\ 30 \qquad \textbf{(B)}\ 33 \qquad \textbf{(C)}\ 35 \qquad \textbf{(D)}\ 36 \qquad \textbf{(E)}\ 37$

In a tetrahedral $ABCD$, given that $\angle ADB=\angle BDC =\angle CDA=\frac{\pi}{3}$, $AD=BD=3$, and $CD=2$. Find the radius of the circumsphere of $ABCD$.

(a) For each integer $k\ge 3$, find a positive integer $n$ that can be represented as the sum of exactly $k$ mutually distinct positive divisors of $n$. (b) Suppose that $n$ can be expressed as the sum of exactly $k$ mutually distinct positive divisors of $n$ for some $k\ge 3$. Let $p$ be the smallest prime divisor of $n$. Show that \[\frac1p+\frac1{p+1}+\cdots+\frac{1}{p+k-1}\ge1.\]

A parallelogram has $3$ of its vertices at $(1, 2)$, $(3,8)$, and $(4, 1)$. Compute the sum of the possible $x$-coordinates for the $4$th vertex.

In a triangle $ABC$, points $X$ and $Y$ are on $BC$ and $CA$ respectively such that $CX=CY$,$AX$ is not perpendicular to $BC$ and $BY$ is not perpendicular to $CA$.Let $\Gamma$ be the circle with $C$ as centre and $CX$ as its radius.Find the angles of triangle $ABC$ given that the orthocentres of triangles $AXB$ and $AYB$ lie on $\Gamma$.

$32$ knights live in a kingdom. Some of them are servants of others. A servant may have only one master and any master is more wealthy than any of his servants. A knight having not less than $4$ servants is called a baron. What is the maximum number of barons? (The kingdom is ruled by the law: “My servant’s servant is not my servant”. (A. Tolpygo, Kiev)

In an isosceles trapezoid, one of the bases is three times larger than the other. Angle at a greater basis is equal to $45^o$. Show how to cut this trapezium into three parts and make a square with them. Justify your answer.

Define a domino to be a $1\times 2$ rectangular block. A $2023\times 2023$ square grid is filled with non-overlapping dominoes, leaving a single $1\times 1$ gap. John then repeatedly slides dominoes into the gap; each domino is moved at most once. What is the maximum number of times that John could have moved a domino? (Example: In the $3\times 3$ grid shown below, John could move 2 dominoes: $D$, followed by $A$.) [asy] unitsize(18); draw((0,0)--(3,0)--(3,3)--(0,3)--(0,0)--cycle); draw((0,1)--(3,1)); draw((2,0)--(2,3)); draw((1,1)--(1,3)); label("A",(0.5,2)); label("B",(1.5,2)); label("C",(2.5,2)); label("D",(1,0.5)); [/asy]

Let $A,B,C$ be three points with integer coordinates in the plane and $K$ a circle with radius $R$ passing through $A,B,C$. Show that $AB\cdot BC\cdot CA\ge 2R$, and if the centre of $K$ is in the origin of the coordinates, show that $AB\cdot BC\cdot CA\ge 4R$.

Find all natural numbers $ n > 1$ such that $ n^{2}$ does $ \text{not}$ divide $ (n \minus{} 2)!$.

Suppose $s,k,t\in \mathbb N$. We've colored each natural number with one of the $k$ colors, such that each color is used infinitely many times. We want to choose a subset $\mathcal A$ of $\mathbb N$ such that it has $t$ disjoint monochromatic $s$-element subsets. What is the minimum number of elements of $A$? [i]Proposed by Navid Adham[/i]

Let's call a polynomial [i]mixed[/i] if it has both positive and negative coefficients ($0$ isn't considered positive or negative). Is the product of two mixed polynomials always mixed? [i]Proposed by Vadym Koval[/i]