$10$ rectangles have their vertices lie on a circle. The vertices divide the circle into $40$ equal arcs. Prove that two of the rectangles are congruent. [i]Proposed by Evan Chang (squareman), USA[/i]

Let $ \Psi\equal{}\langle A;...\rangle$ be an arbitrary, countable algebraic structure (that is, $ \Psi$ can have an arbitrary number of finitary operations and relations). Prove that $ \Psi$ has as many as continuum automorphisms if and only if for any finite subset $ A'$ of $ A$ there is an automorphism $ \pi_{A'}$ of $ \Psi$ different from the identity automorphism and such that \[ (x) \pi_{A'}\equal{}x\] for every $ x \in A'$. [i]M. Makkai[/i]

Find all positive integers $r$ with the property that there exists positive prime numbers $p$ and $q$ so that $$p^2 + pq + q^2 = r^2 .$$

Let $ABC$ be a triangle with $AB = 5$, $BC = 6$, and $AC = 7$. Let its orthocenter be $H$ and the feet of the altitudes from $A, B, C$ to the opposite sides be $D, E, F$ respectively. Let the line $DF$ intersect the circumcircle of $AHF$ again at $X$. Find the length of $EX$.

$a$ and $b$ are positive integers. When written in binary, $a$ has $2004$ $1$'s, and $b$ has $2005$ $1$'s (not necessarily consecutive). What is the smallest number of $1$'s $a + b$ could possibly have?

For $a>1$, let $f(a)=\frac{1}{2}\int_0^1 |ax^n-1|dx+\frac{1}{2}\ (n=1,2,\cdots)$ and let $b_n$ be the minimum value of $f(a)$ at $a>1$. Evaluate \[\lim_{m\to\infty} b_m\cdot b_{m+1}\cdot \cdots\cdots b_{2m}\ (m=1,2,3,\cdots)\]

The base of a prism is an $n$-gon. We wish to colour its $2n$ vertices in three colours in such a way that every vertex is connected by edges to vertices of all three colours. (a) Prove that if $n$ is divisible by $3$, then the task is possible. {b) Prove that if the task is possible, then $n$ is divisible by $3$. (A Shapovalov)

A triangle has altitudes of length $15$, $21$, and $35$. Find its area.

Let $a_1,a_2,\cdots$ be a strictly increasing sequence on positive integers. Is it always possible to partition the set of natural numbers $\mathbb{N}$ into infinitely many subsets with infinite cardinality $A_1,A_2,\cdots$, so that for every subset $A_i$, if we denote $b_1<b_2<\cdots$ be the elements of $A_i$, then for every $k\in \mathbb{N}$ and for every $1\le i\le a_k$, it satisfies $b_{i+1}-b_{i}\le k$?

Let $A$ be a real $n\times n$ matrix such that $A^3=0$ a) prove that there is unique real $n\times n$ matrix $X$ that satisfied the equation $X+AX+XA^2=A$ b) Express $X$ in terms of $A$

A version of billiards is played on a right triangular table, with a pocket in each of the three corners, and one of the acute angles being $30^o$. A ball is played from just in front of the pocket at the $30^o$. vertex toward the midpoint of the opposite side. Prove that if the ball is played hard enough, it will land in the pocket of the $60^o$ vertex after $8$ reflections.

The distinct positive integers $a$ and $b$ have the property that $$\frac{a+b}{2},\quad\sqrt{ab},\quad\frac{2}{\frac{1}{a}+\frac{1}{b}}$$ are all positive integers. Find the smallest possible value of $\left|a-b\right|$.

The acute triangle $ABC$ $(AC> BC)$ is inscribed in a circle with the center at the point $O$, and $CD$ is the diameter of this circle. The point $K$ is on the continuation of the ray $DA$ beyond the point $A$. And the point $L$ is on the segment $BD$ $(DL> LB)$ so that $\angle OKD = \angle BAC$, $\angle OLD = \angle ABC$. Prove that the line $KL$ passes through the midpoint of the segment $AB$.

Denote by $S(n)$ the sum of the digits of the positive integer $n$. Find all the solutions of the equation $n(S(n)-1)=2010.$

Let $p(z)$ be a polynomial of degree $n>0$ with complex coefficients. Prove that there are at least $n+1$ complex numbers $z$ for which $p(z)\in \{0,1\}$.

A triangle with side lengths in the ratio $ 3: 4: 5$ is inscribed in a circle of radius $ 3$. What is the area of the triangle? $ \textbf{(A)}\ 8.64 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 5\pi \qquad \textbf{(D)}\ 17.28 \qquad \textbf{(E)}\ 18$

Find all pairs $(x,y)$, $x,y\in \mathbb{N}$ for which $gcd(n(x!-xy-x-y+2)+2,n(x!-xy-x-y+3)+3)>1$ for $\forall$ $n\in \mathbb{N}$.

Let $n$ be the number of $2024$ digit base-$10$ numbers that satisfy the property $f(9x) = x$, where $f$ is the function that reverses the base-$10$ digits of a number. Estimate the number of digits in the base-$10$ representation of $n$. \\\\ Your score will be calculated by the function $\max(0, \lfloor\frac{200\log_{10}A}{(A - S)^2+10\log_{10}A}\rfloor)$, where $S$ is your submission and $A$ is the true answer. [i]Lightning 5.3[/i]

Given an integer $ n > 3.$ Let $ a_{1},a_{2},\cdots,a_{n}$ be real numbers satisfying $ min |a_{i} \minus{} a_{j}| \equal{} 1, 1\le i\le j\le n.$ Find the minimum value of $ \sum_{k \equal{} 1}^n|a_{k}|^3.$

Let $\triangle ABC$ and $A'$,$B'$,$C'$ the symmetrics of vertex over opposite sides.The intersection of the circumcircles of $\triangle ABB'$ and $\triangle ACC'$ is $A_1$.$B_1$ and $C_1$ are defined similarly.Prove that lines $AA_1$,$BB_1$ and $CC_1$ are concurent.

Prove that if $a$ and $b$ are legs, $c$ is the hypotenuse of a right triangle, then the radius of a circle inscribed in this triangle can be found by the formula $r = \frac12 (a + b - c)$.

Let $\omega$ be a $n$ -th primitive root of unity. Given complex numbers $a_1,a_2,\cdots,a_n$, and $p$ of them are non-zero. Let $$b_k=\sum_{i=1}^n a_i \omega^{ki}$$ for $k=1,2,\cdots, n$. Prove that if $p>0$, then at least $\tfrac{n}{p}$ numbers in $b_1,b_2,\cdots,b_n$ are non-zero.

In a triangle $ABC$, $T$ is the centroid and $ \angle TAB = \angle ACT$. Find the maximum possible value of $sin \angle CAT +sin \angle CBT$.

For all real numbers $a$ and $b$, let \[a\Join b=\dfrac{a+b}{a-b}.\] Compute $1008\Join 1007$. [i] Proposed by David Altizio [/i]

Find the number of rectangles that can be formed inside a fixed regular dodecagon ($12$-gon) where each side of the rectangle lies on either a side or a diagonal of the dodecagon. The diagram below shows three of those rectangles. [asy] unitsize(40); real r = pi/6; pair A1 = (cos(r),sin(r)); pair A2 = (cos(2r),sin(2r)); pair A3 = (cos(3r),sin(3r)); pair A4 = (cos(4r),sin(4r)); pair A5 = (cos(5r),sin(5r)); pair A6 = (cos(6r),sin(6r)); pair A7 = (cos(7r),sin(7r)); pair A8 = (cos(8r),sin(8r)); pair A9 = (cos(9r),sin(9r)); pair A10 = (cos(10r),sin(10r)); pair A11 = (cos(11r),sin(11r)); pair A12 = (cos(12r),sin(12r)); draw(A1--A2--A3--A4--A5--A6--A7--A8--A9--A10--A11--A12--cycle); filldraw(A2--A1--A8--A7--cycle, mediumgray, linewidth(1.2)); draw(A4--A11); draw(0.365*A3--0.365*A12, linewidth(1.2)); dot(A1); dot(A2); dot(A3); dot(A4); dot(A5); dot(A6); dot(A7); dot(A8); dot(A9); dot(A10); dot(A11); dot(A12); [/asy]