Let $A$ be a $101$-element subset of the set $S=\{1,2,\ldots,1000000\}$. Prove that there exist numbers $t_1$, $t_2, \ldots, t_{100}$ in $S$ such that the sets \[ A_j=\{x+t_j\mid x\in A\},\qquad j=1,2,\ldots,100 \] are pairwise disjoint.

Let $P$ be an arbitrary point in the plane of triangle $ABC$. Lines $PA, PB, PC$ meets the perpendicular bisectors of $BC,CA,AB$ at $O_a,O_b,O_c$ respectively. Let $(O_a)$ be the circle with center $O_a$ passing through two points $B,C$, two circles $(O_b), (O_c)$ are defined in the same manner. Two circles $(O_b), (O_c)$ meets at $A_1$, distinct from $A$. Points $B_1,C_1$ are defined in the same manner. Let $Q$ be an arbitrary point in the plane of $ABC$ and $QB,QC$ meets $(O_c)$ and $(O_b)$ at $A_2,A_3$ distinct from $B,C$. Similarly, we have points $B_2,B_3,C_2,C_3$. Let $(K_a), (K_b), (K_c)$ be the circumcircles of triangles $A_1A_2A_3, B_1B_2B_3, C_1C_2C_3$. Prove that (a) three circles $(K_a), (K_b), (K_c)$ have a common point. (b) two triangles $K_aK_bK_c, ABC$ are similar. Trần Quang Hùng

Find minimal number of divisors that can number $|2016^m-36^n|$ have,where $m$ and $n$ are natural numbers.

Prove that for any positive integers $m>n$, there is infinitely many positive integers $a,b$ such that set of prime divisors of $a^m+b^n$ is equal to set of prime divisors of $a^{2019}+b^{1398}$.

Let a rad number be a palindrome such that the square root of the sum of its digits is irrational. Find the number of $4$-digit rad numbers. [i]Lightning 2.2[/i]

Let $\omega$ be a circle with center $O$ and a non-diameter chord $BC$ of $\omega$. A point $A$ varies on $\omega$ such that $\angle BAC<90^{\circ}$. Let $S$ be the reflection of $O$ through $BC$. Let $T$ be a point on $OS$ such that the bisector of $\angle BAC$ also bisects $\angle TAS$. 1. Prove that $TB=TC=TO$. 2. $TB, TC$ cut $\omega$ the second times at points $E, F$, respectively. $AE, AF$ cut $BC$ at $M, N$, respectively. Let $SM$ intersects the tangent line at $C$ of $\omega$ at $X$, $SN$ intersects the tangent line at $B$ of $\omega$ at $Y$. Prove that the bisector of $\angle BAC$ also bisects $\angle XAY$.

Let $ABC$ be a triangle and $H, O$ be its orthocenter and circumcenter, respectively. Construct a triangle by points $D_1, E_1, F_1,$ where $D_1$ lies on lines $BO$ and $AH$, $E_1$ lies on lines $CO$ and $BH$, and $F_1$ lies on lines $AO$ and $CH$. On the other hand, construct the other triangle $D_2E_2F_2$ that $D_2$ lies on $CO$ and $AH$, $E_2$ lies on $AO$ and $BH$, and $F_2$ lies on lines $BO$ and $CH$. Prove that triangles $D_1E_1F_1$ and $D_2E_2F_2$ are similar. [i]Proposed by Saintan Wu[/i]

In Kacs Aladár street, houses are only found on one side of the road, so that only odd house numbers are found along the street. There are an odd number of allotments, as well. The middle three allotments belong to Scrooge McDuck, so he only put up the smallest of the three house numbers. The numbering of the other houses is standard, and the numbering begins with $1$. What is the largest number in the street if the sum of house numbers put up is $3133$?

Let $x$ be a positive real number. Define \[ A = \sum_{k=0}^{\infty} \frac{x^{3k}}{(3k)!}, \quad B = \sum_{k=0}^{\infty} \frac{x^{3k+1}}{(3k+1)!}, \quad\text{and}\quad C = \sum_{k=0}^{\infty} \frac{x^{3k+2}}{(3k+2)!}. \] Given that $A^3+B^3+C^3 + 8ABC = 2014$, compute $ABC$. [i]Proposed by Evan Chen[/i]

Let $ a_1,a_2,\dots$ be a sequence of integers determined by the rule $ a_n\equal{}a_{n\minus{}1}/2$ if $ a_{n\minus{}1}$ is even and $ a_n\equal{}3a_{n\minus{}1}\plus{}1$ if $ a_{n\minus{}1}$ is odd. For how many positive integers $ a_1 \le 2008$ is it true that $ a_1$ is less than each of $ a_2$, $ a_3$, and $ a_4$? $ \textbf{(A)}\ 250 \qquad \textbf{(B)}\ 251 \qquad \textbf{(C)}\ 501 \qquad \textbf{(D)}\ 502 \qquad \textbf{(E)}\ 1004$

If $ a$, $ b$, $ c$, $ d$, and $ e$ are constants such that every $ x > 0$ satisfies \[ \frac{5x^4 \minus{} 8x^3 \plus{} 2x^2 \plus{} 4x \plus{} 7}{(x \plus{} 2)^4} \equal{} a \plus{} \frac{b}{x \plus{} 2} \plus{} \frac{c}{(x \plus{} 2)^2} \plus{} \frac{d}{(x \plus{} 2)^3} \plus{} \frac{e}{(x \plus{} 2)^4} \, ,\] then what is the value of $ a \plus{} b \plus{} c \plus{} d \plus{} e$?

Suppose that $ p$ is a prime number. Prove that the equation $ x^2\minus{}py^2\equal{}\minus{}1$ has a solution if and only if $ p\equiv1\pmod 4$.

One hundred empty glasses are arranged in a $10 \times 10$ array. Now we pick $a$ of the rows and pour blue liquid into all glasses in these rows, so that they are half full. The remaining rows are filled halfway with yellow liquid. Afterwards, we pick $b$ of the columns and fill them up with blue liquid. The remaining columns are filled up with yellow liquid. The mixture of blue and yellow liquid turns green. If both halves have the same colour, then that colour remains as it is. [list=a] [*] Determine all possible combinations of values for $a$ and $b$ so that exactly half of the glasses contain green liquid at the end. [*] Is it possible that precisely one quarter of the glasses contain green liquid at the end? [/list]

Let $x, y, z, a,b, c$ are pairwise different integers from the set $\{1,2,3, 4,5,6\}$. Find the smallest possible value for expression $xyz + abc - ax - by - cz$.

Let $x_0, x_1, \dots , x_{n_0-1}$ be integers, and let $d_1, d_2, \dots, d_k$ be positive integers with $n_0 = d_1 > d_2 > \cdots > d_k$ and $\gcd (d_1, d_2, \dots , d_k) = 1$. For every integer $n \ge n_0$, define \[ x_n = \left\lfloor{\frac{x_{n-d_1} + x_{n-d_2} + \cdots + x_{n-d_k}}{k}}\right\rfloor. \] Show that the sequence $\{x_n\}$ is eventually constant.

Triangle $\vartriangle ABC$ has $\angle ABC = \angle BCA = 45^o$ and $AB = 1$. Let $D$ be on $\overline{AC}$ such that $\angle ABD =30^o$. Let $\overleftrightarrow{BD}$ and the line through $A$ parallel to $\overleftrightarrow{BC}$ intersect at $E$. Compute the area of $\vartriangle ADE$.

Suppose that a sequence $(a_n)_{n=1}^{\infty}$ of integers has the following property: For all $n$ large enough (i.e. $n \ge N$ for some $N$ ), $a_n$ equals the number of indices $i$, $1 \le i < n$, such that $a_i + i \ge n$. Find the maximum possible number of integers which occur infinitely many times in the sequence.

An elephant writes a sequence of numbers on a board starting with 1. Each minute, it doubles the sum of all the numbers on the board so far, and without erasing anything, writes the result on the board. It stops after writing a number greater than one billion. How many distinct prime factors does the largest number on the board have? [i]Ray Li.[/i]

Find the volume of the solid obtained by revolving the region bounded by the graphs of $y=xe^{1-x}$ and $y=x$ around the $x$ axis.

Solve the functional equation $$f(x+y)+f(x-y)=2f(x)\cos{y}$$ where $x,y \in \mathbb{R}$ and $f : \mathbb{R} \rightarrow \mathbb{R}$

Balls numbered $1,2,3,\ldots$ are deposited in $5$ bins, labeled $A,B,C,D,$ and $E$, using the following procedure. Ball $1$ is deposited in bin $A$, and balls $2$ and $3$ are deposted in $B$. The next three balls are deposited in bin $C$, the next $4$ in bin $D$, and so on, cycling back to bin $A$ after balls are deposited in bin $E$. (For example, $22,23,\ldots,28$ are despoited in bin $B$ at step 7 of this process.) In which bin is ball $2024$ deposited? $\textbf{(A) }A\qquad\textbf{(B) }B\qquad\textbf{(C) }C\qquad\textbf{(D) }D\qquad\textbf{(E) }E$

Denote by $\mathbb{N}$ the set of positive integers. Find all functions $f:\mathbb{N} \rightarrow \mathbb{N}$ such that: [b]•[/b] For all positive integers $a> 2023^{2023}$ it holds that $f(a) \leq a$. [b]•[/b] $\frac{a^2f(b)+b^2f(a)}{f(a)+f(b)}$ is a positive integer for all $a,b \in \mathbb{N}$. [i]Proposed by Nikola Velov[/i]

The incircle of a non-isosceles triangle $ABC$ with the center $I$ touches the sides $BC,AC,AB$ at $A_{1},B_{1},C_{1}$ . let $AI,BI,CI$ meets $BC,AC,AB$ at $A_{2},B_{2},C_{2}$. let $A'$ is a point on $AI$ such that $A_{1}A'\perp B_{2}C_{2}$ .$B',C'$ respectively. prove that two triangle $A'B'C',A_{1}B_{1}C_{1}$ are equal.

It's known that there is always a prime between $n$ and $2n-7$ for all $n \ge 10$. Prove that, with the exception of $1$, $4$, and $6$, every natural number can be written as the sum of distinct primes.

Consider an $n \times n$ grid consisting of $n^2$ until cells, where $n \geq 3$ is a given odd positive integer. First, Dionysus colours each cell either red or blue. It is known that a frog can hop from one cell to another if and only if these cells have the same colour and share at least one vertex. Then, Xanthias views the colouring and next places $k$ frogs on the cells so that each of the $n^2$ cells can be reached by a frog in a finite number (possible zero) of hops. Find the least value of $k$ for which this is always possible regardless of the colouring chosen by Dionysus. [i]Proposed by Tommy Walker Mackay, United Kingdom[/i]