Point $C$ is chosen on the arc of a semicircle with diameter $AB$. The two circles with diameters of $AC$ and $BC$ intersect again at point $D$. If $DA=20$ and $DB=16$, compute the length of $DC$.

A convex pentagon has the property that each of its diagonals cuts off a triangle of unit area. Find the area of the pentagon.

Prove that for every integer $n > 10000$ there exists an integer $m$ such that it can be written as the sum of two squares, and $0<m-n<3\sqrt[4]n$.

A number of runners competed in a race. When Ammar finished, there were half as many runners who had finished before him compared to the number who finished behind him. Julia was the 10th runner to finish behind Ammar. There were twice as many runners who had finished before Julia compared to the number who finished behind her. How many runners were there in the race?

For a given integer $ n\geq 2,$ determine the necessary and sufficient conditions that real numbers $ a_{1},a_{2},\cdots, a_{n},$ not all zero satisfy such that there exist integers $ 0<x_{1}<x_{2}<\cdots<x_{n},$ satisfying $ a_{1}x_{1}\plus{}a_{2}x_{2}\plus{}\cdots\plus{}a_{n}x_{n}\geq 0.$

[b]T[/b]wo ordered pairs $(a,b)$ and $(c,d)$, where $a,b,c,d$ are real numbers, form a basis of the coordinate plane if $ad \neq bc$. Determine the number of ordered quadruples $(a,b,c)$ of integers between $1$ and $3$ inclusive for which $(a,b)$ and $(c,d)$ form a basis for the coordinate plane.

Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that $f(0) \in \mathbb Q$ and \[f(x+f(y)^2 ) = {f(x+y)}^2.\] (25 points)

Let $S$ be the set of positive integer divisors of $20^9.$ Three numbers are chosen independently and at random from the set $S$ and labeled $a_1,a_2,$ and $a_3$ in the order they are chosen. The probability that both $a_1$ divides $a_2$ and $a_2$ divides $a_3$ is $\frac mn,$ where $m$ and $n$ are relatively prime positive integers. Find $m.$

Denote $\mathbb{Z}_{>0}=\{1,2,3,...\}$ the set of all positive integers. Determine all functions $f:\mathbb{Z}_{>0}\rightarrow \mathbb{Z}_{>0}$ such that, for each positive integer $n$, $\hspace{1cm}i) \sum_{k=1}^{n}f(k)$ is a perfect square, and $\vspace{0.1cm}$ $\hspace{1cm}ii) f(n)$ divides $n^3$. [i]Proposed by Dorlir Ahmeti, Albania[/i]

A pentagon $ABCDE$ is such that $ABCD$ is cyclic, $BE\parallel CD$, and $DB=DE$. Let us fix the points $B,C,D,E$ and vary $A$ on the circumcircle of $BCD$. Let $P=AC\cap BE$, and $Q=BC\cap DE$. Prove that the second intersection of circles $(ABE)$ and $(PQE)$ lie on a fixed circle.

Find the smallest positive integer $n$ that is divisible by $100$ and has exactly $100$ divisors.

A long time ago, there existed Martians with $3$ different colours: red, green and blue. As Mars was devastated by an intergalactic war, only $2$ Martians of each colours survived. In order to reconstruct the Martian population, they decided to use a machine that transforms two Martians of distinct colours into four Martians of colour different to the two initial ones. For example, if a red Martian and a blue Martian use the machine, they'll be transformed into four green Martians. a) Is it possible that, after using that machine finitely many times, we have $2022$ red Martians, $2022$ green Martians and $2022$ blue Martians? b) Is it possible that, after using that machine finitely many times, we have $2021$ red Martians, $2022$ green Martians and $2023$ blue Martians?

For a positive integer $n$, denote $p(n)$ to be the number of nonnegative integer tuples $(x,y,z,w)$ such that $x+2y+2z+3w=n$. Also, denote $q(n)$ to be the number of nonnegative integer tuples $(a,b,c,d)$ such that (i) $a+b+c+d=n$ (ii) $a \ge b \ge d$ (iii) $a \ge c \ge d$ Prove that for all $n$, $p(n) = q(n)$.

Alice and Bob are playing "factoring game." On the paper, $270000(=2^43^35^4)$ is written and each person picks one number from the paper(call it $N$) and erase $N$ and writes integer $X,Y$ such that $N=XY$ and $\text{gcd}(X,Y)\ne1.$ Alice goes first and the person who can no longer make this factoring loses. If two people use optimal strategy, prove that Alice always win.

Points $A,B,C$ lie on a circle $\omega$ such that $BC$ is a diameter. $AB$ is extended past $B$ to point $B'$ and $AC$ is extended past $C$ to point $C'$ such that line $B'C'$ is parallel to $BC$ and tangent to $\omega$ at point $D$. If $B'D = 4$ and $C'D = 6$, compute $BC$.

A number of linked rings, each 1 cm thick, are hanging on a peg. The top ring has an outside diameter of 20 cm. The outside diameter of each of the outer rings is 1 cm less than that of the ring above it. The bottom ring has an outside diameter of 3 cm. What is the distance, in cm, from the top of the top ring to the bottom of the bottom ring? [asy] size(200); defaultpen(linewidth(3)); real[] inrad = {40,34,28,21}; real[] outrad = {55,49,37,30}; real[] center; path[][] quad = new path[4][4]; center[0] = 0; for(int i=0;i<=3;i=i+1) { if(i != 0) { center[i] = center[i-1] - inrad[i-1] - inrad[i]+3.5; } quad[0][i] = arc((0,center[i]),inrad[i],0,90)--arc((0,center[i]),outrad[i],90,0)--cycle; quad[1][i] = arc((0,center[i]),inrad[i],90,180)--arc((0,center[i]),outrad[i],180,90)--cycle; quad[2][i] = arc((0,center[i]),inrad[i],180,270)--arc((0,center[i]),outrad[i],270,180)--cycle; quad[3][i] = arc((0,center[i]),inrad[i],270,360)--arc((0,center[i]),outrad[i],360,270)--cycle; draw(circle((0,center[i]),inrad[i])^^circle((0,center[i]),outrad[i])); } void fillring(int i,int j) { if ((j % 2) == 0) { fill(quad[i][j],white); } else { filldraw(quad[i][j],black); } } for(int i=0;i<=3;i=i+1) { for(int j=0;j<=3;j=j+1) { fillring(((2-i) % 4),j); } } for(int k=0;k<=2;k=k+1) { filldraw(circle((0,-228 - 25 * k),3),black); } real r = 130, s = -90; draw((0,57)--(r,57)^^(0,-57)--(r,-57),linewidth(0.7)); draw((2*r/3,56)--(2*r/3,-56),linewidth(0.7),Arrows(size=3)); label("$20$",(2*r/3,-10),E); draw((0,39)--(s,39)^^(0,-39)--(s,-39),linewidth(0.7)); draw((9*s/10,38)--(9*s/10,-38),linewidth(0.7),Arrows(size=3)); label("$18$",(9*s/10,0),W); [/asy] $ \textbf{(A) } 171\qquad \textbf{(B) } 173\qquad \textbf{(C) } 182\qquad \textbf{(D) } 188\qquad \textbf{(E) } 210$

We say that distinct positive integers $n, m$ are $friends$ if $\vert n-m \vert$ is a divisor of both ${}n$ and $m$. Prove that, for any positive integer $k{}$, there exist $k{}$ distinct positive integers such that any two of these integers are friends.

A square cake of uniform height is evenly covered with frosting on the top and all four sides. Find a way to cut the cake into five portions such that: (a) All portions contain the same amount of cake. (b) All portions contain the same amount of cake and frosting.

Let $(a_n)_{n\ge1}$ be a positive real sequence such that $$\lim_{n\to\infty}\frac{a_n}n=a\in\mathbb R^*_+\enspace\text{and}\enspace\lim_{n\to\infty}\left(\frac{a_{n+1}}{a_n}\right)^n=b\in\mathbb R^*_+$$ Compute $$\lim_{n\to\infty}(a_{n+1}-a_n)$$ [i]Proposed by D.M. Bătinețu-Giurgiu and Neculai Stanciu[/i]

We increased some positive integer by $10\%$ and obtained a positive integer. Is it possible that in doing so we decreased the sum of digits exactly by $10\%$ ?

Let $n = 2^{19}3^{12}$. Let $M$ denote the number of positive divisors of $n^2$ which are less than $n$ but would not divide $n$.What is the number formed by taking the last two digits of $M$ (in the same order)?

Each cell of an $m\times n$ board is filled with some nonnegative integer. Two numbers in the filling are said to be [i]adjacent[/i] if their cells share a common side. (Note that two numbers in cells that share only a corner are not adjacent). The filling is called a [i]garden[/i] if it satisfies the following two conditions: (i) The difference between any two adjacent numbers is either $0$ or $1$. (ii) If a number is less than or equal to all of its adjacent numbers, then it is equal to $0$. Determine the number of distinct gardens in terms of $m$ and $n$.

We have sheet of paper, divided on $100\times 100$ unit squares. In some squares we put rightangled isosceles triangles with leg =$1$ ( Every triangle lies in one unit square and is half of this square). Every unit grid segment( boundary too) is under one leg of triangle. Find maximal number of unit squares, that don`t contains triangles.

Let $n$ be a positive integer. Beto writes a list of $n$ non-negative integers on the board. Then he performs a succession of moves (two steps) of the following type: First for each $i=1,2,...,n$, he counts how many numbers on the board are less than or equal to $i$. Let $a_i$ be the number obtained for each $i=1,2,...,n$. Next, he erases all the numbers from the board and writes the numbers $a_1,a_2,...,a_n$. For example, if $n=5$ and the initial numbers on the board are $0,7,2,6,2$, after the first move, the numbers on the board will bec$1,3,3,3,3$;after the second move they will be $1,1,5,5,5$, and so on. $a)$ Show that, for every $n$ and every initial configuration, there will come a time after which the numbers will no longer be modified when using this move. $b)$Find (as a function of $n$) the minimum value of $k$ such that, for any initial configuration, the moves made from move number $k$ will not change the numbers on the board.

In $\Delta ABC$, let $D$ be a point on side $BC$. Suppose the incircle $\omega_1$ of $\Delta ABD$ touches sides $AB$ and $AD$ at $E,F$ respectively, and the incircle $\omega_2$ of $\Delta ACD$ touches sides $AD$ and $AC$ at $F,G$ respectively. Suppose the segment $EG$ intersects $\omega_1$ and $\omega_2$ again at $P$ and $Q$ respectively. Show that line $AD$, tangent of $\omega_1$ at $P$ and tangent of $\omega_2$ at $Q$ are concurrent.