Using only the digits $2,3$ and $9$, how many six-digit numbers can be formed which are divisible by $6$?

We say that a finite set $\mathcal{S}$ of points in the plane is [i]balanced[/i] if, for any two different points $A$ and $B$ in $\mathcal{S}$, there is a point $C$ in $\mathcal{S}$ such that $AC=BC$. We say that $\mathcal{S}$ is [i]centre-free[/i] if for any three different points $A$, $B$ and $C$ in $\mathcal{S}$, there is no points $P$ in $\mathcal{S}$ such that $PA=PB=PC$. (a) Show that for all integers $n\ge 3$, there exists a balanced set consisting of $n$ points. (b) Determine all integers $n\ge 3$ for which there exists a balanced centre-free set consisting of $n$ points. Proposed by Netherlands

Let $M=(0,1)\cap \mathbb Q$. Determine, with proof, whether there exists a subset $A\subset M$ with the property that every number in $M$ can be uniquely written as the sum of finitely many distinct elements of $A$.

Triangle $ABC$ is inscribed in a circle. Through points $A$ and $B$ tangents to this circle are drawn, which intersect at point $P$. Points $X$ and $Y$ are orthogonal projections of point $P$ onto lines $AC$ and $BC$. Prove that line $XY$ is perpendicular to the median of triangle $ABC$ from vertex $C$.

There exists a quadrilateral $\mathcal{Q} _{1}$ such that the midpoints of its sides lie on a circle. Prove that there exists a cyclic quadrilateral $\mathcal{Q} _{2}$ with the same sides as $\mathcal{Q} _{1}$ with two of the same angles.

Point $O$ is the center of the circle into which quadrilateral $ABCD$ is inscribed. If angles $AOC$ and $BAD$ are both equal to $110$ degrees and angle $ABC$ is greater than angle $ADC$, prove that $AB+AD>CD$. Fresh translation.

Let $x$ and $y$ be real numbers satisfying $x^4y^5+y^4x^5=810$ and $x^3y^6+y^3x^6=945$. Evaluate $2x^3+(xy)^3+2y^3$.

What is the largest possible value of $8x^2+9xy+18y^2+2x+3y$ such that $4x^2 + 9y^2 = 8$ where $x,y$ are real numbers? $ \textbf{(A)}\ 23 \qquad\textbf{(B)}\ 26 \qquad\textbf{(C)}\ 29 \qquad\textbf{(D)}\ 31 \qquad\textbf{(E)}\ 35 $

Let $a,b,c,d$ be positive real numbers with $abcd=1$. Prove that $$\sqrt{\frac{a}{b+c+d^2+a^3}}+\sqrt{\frac{b}{c+d+a^2+b^3}}+\sqrt{\frac{c}{d+a+b^2+c^3}}+\sqrt{\frac{d}{a+b+c^2+d^3}} \leq 2$$

For each positive integer $ n,$ let $ S(n)$ denote the sum of the digits of $ n.$ For how many values of $ n$ is $ n \plus{} S(n) \plus{} S(S(n)) \equal{} 2007?$ $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

Prove that there are no integers $a, b, c, d$ such that the polynomial $ax^3+bx^2+cx+d$ equals $1$ at $x=19$ and $2$ at $x=62$.

We call natural number $m$ [b]ziba[/b], iff every natural number $n$ with the condition $1\le n\le m$ can be shown as sum of [some of] positive and [u]distinct[/u] divisors of $m$. Prove that infinitely ziba numbers in the form of $(k\in\mathbb{N})k^2+k+2022$ exist.

Find the number of positive integers less than or equal to $2017$ whose base-three representation contains no digit equal to $0$.

Let $S=\{A_1,A_2,\ldots ,A_n\}$, where $A_1,A_2,\ldots ,A_n$ are $n$ pairwise distinct finite sets $(n\ge 2)$, such that for any $A_i,A_j\in S$, $A_i\cup A_j\in S$. If $k= \min_{1\le i\le n}|A_i|\ge 2$, prove that there exist $x\in \bigcup_{i=1}^n A_i$, such that $x$ is in at least $\frac{n}{k}$ of the sets $A_1,A_2,\ldots ,A_n$ (Here $|X|$ denotes the number of elements in finite set $X$).

Find all functions $f: \mathbb{R^{+}} \rightarrow \mathbb {R^{+}}$ such that $f(f(x)+\frac{y+1}{f(y)})=\frac{1}{f(y)}+x+1$ for all $x, y>0$. [i]Proposed by Dominik Burek, Poland[/i]

$(GDR 5)$ Given a ring $G$ in the plane bounded by two concentric circles with radii $R$ and $\frac{R}{2}$, prove that we can cover this region with $8$ disks of radius $\frac{2R}{5}$. (A region is covered if each of its points is inside or on the border of some disk.)

Find all functions $f: (0, \infty) \to (0, \infty)$ such that \begin{align*} f(y(f(x))^3 + x) = x^3f(y) + f(x) \end{align*} for all $x, y>0$. [i]Proposed by Jason Prodromidis, Greece[/i]

If $a$, $b$ and $c$ are real numbers such that $ab = 31$, $ac = 13$, and $bc = 5$, compute the product of all possible values of $abc$.

There are $40$ identical gas cylinders, gas pressure values in which we are unknown and may be evil. It is allowed to connect any cylinders with each other in an amount not exceeding a given natural number $k$, and then separate them; while the pressure gas in the connected cylinders is set equal to the arithmetic average of the pressures in them before the connection. At what minimum $k$ is there a way to equalize the pressures in all $40$ cylinders, regardless of initial pressure distribution in the cylinders?

In a square with side 1 are placed $n$ equilateral triangles (without having any parts outside the square) each with side greater than $\sqrt{\frac{2}{3}}$. Prove that all of the $n$ equilateral triangles have a common inner point.

Let $A,B,C$ denote distinct points with integer coefficients in $\mathbb{R}^2$. Prove that if \[(|AB|+|BC|)^2<8\cdot[ABC]+1\] then $A,B,C$ are three vertices of a square. Here $|XY|$ is the length of segment $XY$ and $[ABC]$ is the area of triangle $ABC$.

Let $N$ be the number of ordered triples of 3 positive integers $(a,b,c)$ such that $6a$, $10b$, and $15c$ are all perfect squares and $abc = 210^{210}$. Find the number of divisors of $N$. [i]Proposed by Andy Xu[/i]

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$

When four gallons are added to a tank that is one-third full, the tank is then one-half full. The capacity of the tank in gallons is $\text{(A)}\ 8 \qquad \text{(B)}\ 12 \qquad \text{(C)}\ 20 \qquad \text{(D)}\ 24 \qquad \text{(E)}\ 48$

Let $L,E,T,M,$ and $O$ be digits that satisfy $LEET+LMT=TOOL.$ Given that $O$ has the value of $0,$ digits may be repeated, and $L\neq0,$ what is the value of the $4$-digit integer $ELMO?$