Find max number $n$ of numbers of three digits such that : 1. Each has digit sum $9$ 2. No one contains digit $0$ 3. Each $2$ have different unit digits 4. Each $2$ have different decimal digits 5. Each $2$ have different hundreds digits

Consider a tetrahedron $SABC$. The incircle of the triangle $ABC$ has the center $I$ and touches its sides $BC$, $CA$, $AB$ at the points $E$, $F$, $D$, respectively. Let $A^{\prime}$, $B^{\prime}$, $C^{\prime}$ be the points on the segments $SA$, $SB$, $SC$ such that $AA^{\prime}=AD$, $BB^{\prime}=BE$, $CC^{\prime}=CF$, and let $S^{\prime}$ be the point diametrically opposite to the point $S$ on the circumsphere of the tetrahedron $SABC$. Assume that the line $SI$ is an altitude of the tetrahedron $SABC$. Show that $S^{\prime}A^{\prime}=S^{\prime}B^{\prime}=S^{\prime}C^{\prime}$.

Let be two natural numbers $ b>a>0 $ and a function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ having the following property. $$ f\left( x^2+ay\right)\ge f\left( x^2+by\right) ,\quad\forall x,y\in\mathbb{R} $$ [b]a)[/b] Show that $ f(s)\le f(0)\le f(t) , $ for any real numbers $ s<0<t. $ [b]b)[/b] Prove that $ f $ is constant on the interval $ (0,\infty ) . $ [b]c)[/b] Give an example of a non-monotone such function.

$ABCD$ is a scalene tetrahedron and let $G$ be its baricentre. A plane $\alpha$ passes through $G$ such that it intersects neither the interior of $\Delta BCD$ nor its perimeter. Prove that $$\textnormal{dist}(A,\alpha)=\textnormal{dist}(B,\alpha)+\textnormal{dist}(C,\alpha)+\textnormal{dist}(D,\alpha).$$ [i] (Adapted from folklore)[/i]

An ant is walking on the edges of an icosahedron of side length $1$. Compute the length of the longest path that the ant can take if it never travels over the same edge twice, but is allowed to revisit vertices. [center]<see attached>[/center]

Let $a_1, a_2, . . . , a_n$ be real numbers. Prove $\sqrt[3]{a_1^3+ a_2^3+ . . . + a_n^3} \le \sqrt{a_1^2+ a_2^2+ . . . + a_n^2} $ (1) When does equality hold in (1)?

a) Factorize $xy - x - y + 1$. b) Prove that if integers $a$ and $b$ satisfy $ |a + b| > |1 + ab|$, then $ab = 0$.

There are 60 empty boxes $B_1,\ldots,B_{60}$ in a row on a table and an unlimited supply of pebbles. Given a positive integer $n$, Alice and Bob play the following game. In the first round, Alice takes $n$ pebbles and distributes them into the 60 boxes as she wishes. Each subsequent round consists of two steps: (a) Bob chooses an integer $k$ with $1\leq k\leq 59$ and splits the boxes into the two groups $B_1,\ldots,B_k$ and $B_{k+1},\ldots,B_{60}$. (b) Alice picks one of these two groups, adds one pebble to each box in that group, and removes one pebble from each box in the other group. Bob wins if, at the end of any round, some box contains no pebbles. Find the smallest $n$ such that Alice can prevent Bob from winning. [i]Czech Republic[/i]

Consider a charged capacitor made with two square plates of side length $L$, uniformly charged, and separated by a very small distance $d$. The EMF across the capacitor is $\xi$. One of the plates is now rotated by a very small angle $\theta$ to the original axis of the capacitor. Find an expression for the difference in charge between the two plates of the capacitor, in terms of (if necessary) $d$, $\theta$, $\xi$, and $L$. Also, approximate your expression by transforming it to algebraic form: i.e. without any non-algebraic functions. For example, logarithms and trigonometric functions are considered non-algebraic. Assume $ d << L $ and $ \theta \approx 0 $. $\emph{Hint}$: You may assume that $ \frac {\theta L}{d} $ is also very small. [i]Problem proposed by Trung Phan[/i] [hide="Clarification"] There are two possible ways to rotate the capacitor. Both were equally scored but this is what was meant: [asy]size(6cm); real h = 7; real w = 2; draw((-w,0)--(-w,h)); draw((0,0)--(0,h), dashed); draw((0,0)--h*dir(64)); draw(arc((0,0),2,64,90)); label("$\theta$", 2*dir(77), dir(77)); [/asy] [/hide]

Let $\mathbb X$ be the set of all bijective functions from the set $S=\{1,2,\cdots, n\}$ to itself. For each $f\in \mathbb X,$ define \[T_f(j)=\left\{\begin{aligned} 1, \ \ \ & \text{if} \ \ f^{(12)}(j)=j,\\ 0, \ \ \ & \text{otherwise}\end{aligned}\right.\] Determine $\sum_{f\in\mathbb X}\sum_{j=1}^nT_{f}(j).$ (Here $f^{(k)}(x)=f(f^{(k-1)}(x))$ for all $k\geq 2.$)

Let $ y$ be the function of $ x$ satisfying the differential equation $ y'' \minus{} y \equal{} 2\sin x$. (1) Let $ y \equal{} e^xu \minus{} \sin x$, find the differential equation with which the function $ u$ with respect to $ x$ satisfies. (2) If $ y(0) \equal{} 3,\ y'(0) \equal{} 0$, then determine $ y$.

In a non-isosceles triangle $ABC$ the centre of the incircle is denoted by $I$. The other intersection point of the angle bisector of $\angle BAC$ and the circumcircle of $\vartriangle ABC$ is $D$. The line through $I$ perpendicular to $AD$ intersects $BC$ in $F$. The midpoint of the circle arc $BC$ on which $A$ lies, is denoted by $M$. The other intersection point of the line $MI$ and the circle through $B, I$ and $C$, is denoted by $N$. Prove that $FN$ is tangent to the circle through $B, I$ and $C$.

Given $\triangle ABC$ and a point $P$ on one of its sides, call line $\ell$ the splitting line of $\triangle ABC$ through $P$ if $\ell$ passes through $P$ and divides $\triangle ABC$ into two polygons of equal perimeter. Let $\triangle ABC$ be a triangle where $BC = 219$ and $AB$ and $AC$ are positive integers. Let $M$ and $N$ be the midpoints of $\overline{AB}$ and $\overline{AC}$, respectively, and suppose that the splitting lines of $\triangle ABC$ through $M$ and $N$ intersect at $30^{\circ}$. Find the perimeter of $\triangle ABC$.

Three circles $\omega_1,\omega_2,\omega_3$ are tangent to line $l$ at points $A,B,C$ ($B$ lies between $A,C$) and $\omega_2$ is externally tangent to the other two. Let $X,Y$ be the intersection points of $\omega_2$ with the other common external tangent of $\omega_1,\omega_3$. The perpendicular line through $B$ to $l$ meets $\omega_2$ again at $Z$. Prove that the circle with diameter $AC$ touches $ZX,ZY$. [i]Proposed by Iman Maghsoudi - Siamak Ahmadpour[/i]

Let $u_1, u_2, \dots, u_{2019}$ be real numbers satisfying \[u_{1}+u_{2}+\cdots+u_{2019}=0 \quad \text { and } \quad u_{1}^{2}+u_{2}^{2}+\cdots+u_{2019}^{2}=1.\] Let $a=\min \left(u_{1}, u_{2}, \ldots, u_{2019}\right)$ and $b=\max \left(u_{1}, u_{2}, \ldots, u_{2019}\right)$. Prove that \[ a b \leqslant-\frac{1}{2019}. \]

Let $ABCD$ be a quadrilateral, $E$ the midpoint of side $BC$, and $F$ the midpoint of side $AD$. Segment $AC$ intersects segment $BF$ at $M$ and segment $DE$ at $N$. If quadrilateral $MENF$ is also known to be a parallelogram, prove that $ABCD$ is also a parallelogram.

Consider finitely many points in the plane such that no three are collinear. Prove that we can paint the points with two colors such that there is no half-plane that contains exactly three points such that those three points have the same color.

Find all functions $f : \mathbb{Q} \to \mathbb{R}$ such that $f(x)f(y)f(x+y) = f(xy)(f(x) + f(y))$ for all $x,y\in\mathbb{Q}$. [i]Sammy Luo and Alex Zhu.[/i]

Let $(G,\cdot)$ be a grup with neutral element $e{}$, and let $H{}$ and $K$ be proper subgroups of $G$, satisfying $H\cap K=\{e\}$. It is known that $(G\setminus(H\cup K))\cup\{e\}$ is closed under the operation of $G$. Prove that $x^2=e$ for all the elements $x{}$ of $G{}$.

Let $n \geq 2$ be a natural number. Find a way to assign natural numbers to the vertices of a regular $2n$-gon such that the following conditions are satisfied: (1) only digits $1$ and $2$ are used; (2) each number consists of exactly $n$ digits; (3) different numbers are assigned to different vertices; (4) the numbers assigned to two neighboring vertices differ at exactly one digit.

On the trapezoid $ABCD$ , side $DA$ is perpendicular to the bases $AB$ and $CD$ . The base $AB$ measures $45$, the base $CD$ measures $20$ and the $BC$ side measures $65$. Let $P$ on the $BC$ side such that $BP$ measures $45$ and $M$ is the midpoint of $DA$. Calculate the measure of the $PM$ segment.

Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ from $C^2$ (id est, $f$ is twice differentiable and $f''$ is continuous.) such that for every real number $t$ we have $f(t)^2=f(t \sqrt{2})$.

Let $ a,b,c$ be positive real numbers. Show that $ 3(a \plus{} b \plus{} c) \ge 8 \sqrt [3]{abc} \plus{} \sqrt [3]{\frac {a^3 \plus{} b^3 \plus{} c^3}{3} }.$

Let $S_n$ be the set of points $(x/2,y/2)\in\mathbb{R}^2$ such that $x$ and $y$ are odd integers and $|x|\leq y\leq 2n$. Let $T_n$ be the number of graphs $G$ with vertex set in $S_n$ satisfying the following conditions: [list] [*]G has no cycles. [*]If two points share an edge, then the distance between them is $1$. [*]For any path $P = (a,\dots,b)$ in $G$, the smallest $y$-coordinate among the points in $P$ is either that of $a$ or that of $b$. However, multiple points may share this $y$-coordinate. [/list] Find the $100$th-smallest positive integer $n$ such that the units digit of $T_{3n}$ is $4$.

We have $10$ points on a line $A_1,A_2\ldots A_{10}$ in that order. Initially there are $n$ chips on point $A_1$. Now we are allowed to perform two types of moves. Take two chips on $A_i$, remove them and place one chip on $A_{i+1}$, or take two chips on $A_{i+1}$, remove them, and place a chip on $A_{i+2}$ and $A_i$ . Find the minimum possible value of $n$ such that it is possible to get a chip on $A_{10}$ through a sequence of moves.