If $a$ and $b$ are digits, how many are there $4$ digit numbers $\overline{3ab4}$ divisible with $9$ . Which numbers are they ($4$ digit numbers)?

There are $2016$ red and $2016$ blue cards each having a number written on it. For some $64$ distinct positive real numbers, it is known that the set of numbers on cards of a particular color happens to be the set of their pairwise sums and the other happens to be the set of their pairwise products. Can we necessarily determine which color corresponds to sum and which to product? [i](B. Frenkin)[/i] (Translated from [url=http://sasja.shap.homedns.org/Turniry/TG/index.html]here.[/url])

There are $n$ rooms in a sauna, each has unlimited capacity. No room may be attended by a female and a male simultaneously. Moreover, males want to share a room only with males that they don't know and females want to share a room only with females that they know. Find the biggest number $k$ such that any $k$ couples can visit the sauna at the same time, given that two males know each other if and only if their wives know each other.

Let $ABCD$ be a cyclic quadrilateral. Let $P$ be the intersection of $BC$ and $AD$. Line $AC$ intersects the circumcircle of triangle $BDP$ in points $S$ and $T$, with $S$ between $A$ and $C$. Line $BD$ intersects the circumcircle of triangle $ACP$ in points $U$ and $V$, with $U$ between $B$ and $D$. Prove that $PS$ = $PT$ = $PU$ = $PV$.

\[\int_1^2 \frac{\sqrt{1-\frac 1x}}{x^2-1}\mathrm dx\] [i]Proposed by Connor Gordon[/i]

Let $\alpha,\beta,\gamma$ be the three real roots of the polynomial $x^3-x^2-2x+1=0$. Find all possible values of $\tfrac{\alpha}{\beta}+\tfrac{\beta}{\gamma}+\tfrac{\gamma}{\alpha}$.

Let $n$ be a positive integer. There are given $n$ lines such that no two are parallel and no three meet at a single point. a) Prove that there exists a line such that the number of intersection points of these $n$ lines on both of its sides is at least $$\left \lfloor \frac{(n-1)(n-2)}{10} \right \rfloor.$$ Notice that the points on the line are not counted. b) Find all $n$ for which there exists a configurations where the equality is achieved.

A deck consists of 13 types of cards: \( A > K > Q > J > 10 > 9 > \dots > 3 > 2 \), each card appearing 4 times. In total, there are 52 cards. Marius and Alexandru each receive half of the standard deck of cards, placing them face down. On each turn, the players simultaneously draw the top card from their hands, and the player with the most valuable card takes both cards and places them under all of his other cards, with Marius deciding the order in which the two cards are placed. In case of a tie, each player places their own card under the rest of their cards. The game ends when one of the players runs out of cards. Is it possible that, although Alexandru initially has all four \( A \) cards, the game lasts forever?

In the triangle $ABC$, angle bisector $CD$ intersects the circumcircle of $ABC$ at the point $K$. (a) Prove the equalities: $$\frac1{ID}-\frac1{IK}=\frac1{CI},\enspace\frac{CI}{ID}-\frac{ID}{DK}=1$$where $I$ is the center of the inscribed circle of triangle $ABC$. (b) On the segment $CK$ some point $P$ is chosen whose projections on $AC,BC,AB$ respectively are $P_1,P_2,P_3$. The lines $PP_3$ and $P_1P_2$ intersect at a point $M$. Find the locus of $M$ when $P$ moves around segment $CK$.

Let $ABCD$ be a rectangle with $AB>BC$. Let points $E,F$ be on side $CD$ such that $CE=ED$ and $BC=CF$. Show that if $AC$ is prependicular to $BE$ then $AB=BF$.

Consider a particle at rest which may decay into two (daughter) particles or into three (daughter) particles. Which of the following is true in the two-body case but false in the three-body case? (There are no external forces.) (a) The velocity vectors of the daughter particles must lie in a single plane. (b) Given the total kinetic energy of the system and the mass of each daughter particle, it is possible to determine the speed of each daughter particle. (c) Given the speed(s) of all but one daughter particle, it is possible to determine the speed of the remaining particle. (d) The total momentum of the daughter particles is zero. (e) None of the above.

The set $\{1, 2, \cdots, 49\}$ is divided into three subsets. Prove that at least one of these subsets contains three different numbers $a, b, c$ such that $a + b = c$.

Find all functions $f:\mathbb{R}^+\to\mathbb{R}^+$ such that whenever $a>b>c>d>0$ and $ad=bc$, \[f(a+d)+f(b-c)=f(a-d)+f(b+c).\] [i]Calvin Deng.[/i]

In a $999 \times 999$ square table some cells are white and the remaining ones are red. Let $T$ be the number of triples $(C_1,C_2,C_3)$ of cells, the first two in the same row and the last two in the same column, with $C_1,C_3$ white and $C_2$ red. Find the maximum value $T$ can attain. [i]Proposed by Merlijn Staps, The Netherlands[/i]

Consider $f(x)=x^4+ax^3+bx^2+cx+d\; (a,b,c,d\in\mathbb{R})$. It is known that $f$ intersects X-axis in at least $3$ (distinct) points. Show either $f$ has $4$ $\mathbf{distinct}$ real roots or it has $3$ $\mathbf{distinct}$ real roots and one of them is a point of local maxima or minima.

Let \(n\) be a positive integer. On a \(2 \times 3 n\) board, we mark some squares, so that any square (marked or not) is adjacent to at most two other distinct marked squares (two squares are adjacent when they are distinct and have at least one vertex in common, i.e. they are horizontal, vertical or diagonal neighbors; a square is not adjacent to itself). (a) What is the greatest possible number of marked square? (b) For this maximum number, in how many ways can we mark the squares? configurations that can be achieved through rotation or reflection are considered distinct.

Let $ABC$ be a triangle in which $AB =AC$ and $\angle CAB = 90^{\circ}$. Suppose that $M$ and $N$ are points on the hypotenuse $BC$ such that $BM^2 + CN^2 = MN^2$. Prove that $\angle MAN = 45^{\circ}$.

[b](i)[/b] Solve the equation: \[ \sin^3(x) + \sin^3\left( \frac{2 \pi}{3} + x\right) + \sin^3\left( \frac{4 \pi}{3} + x\right) + \frac{3}{4} \cos {2x} = 0.\] [b](ii)[/b] Supposing the solutions are in the form of arcs $AB$ with one end at the point $A$, the beginning of the arcs of the trigonometric circle, and $P$ a regular polygon inscribed in the circle with one vertex in $A$, find: 1) The subsets of arcs having the other end in $B$ in one of the vertices of the regular dodecagon. 2) Prove that no solution can have the end $B$ in one of the vertices of polygon $P$ whose number of sides is prime or having factors other than 2 or 3.

Find the sum of all prime numbers $p$ such that $p$ divides $$(p^2+p+20)^{p^2+p+2}+4(p^2+p+22)^{p^2-p+4}.$$

A nonempty set $S$ is called [i]Bally[/i] if for every $m\in S$, there are fewer than $\frac{1}{2}m$ elements of $S$ which are less than $m$. Determine the number of Bally subsets of $\{1, 2, . . . , 2020\}$.

Let $S = \mathbb Z \times \mathbb Z$. A subset $P$ of $S$ is called [i]nice[/i] if [list] [*] $(a, b) \in P \implies (b, a) \in P$ [*] $(a, b)$, $(c, d)\in P \implies (a + c, b - d) \in P$ [/list] Find all $(p, q) \in S$ so that if $(p, q) \in P$ for some [i]nice[/i] set $P$ then $P = S$.

You are given a set of $n$ blocks, each weighing at least $1$; their total weight is $2n$. Prove that for every real number $r$ with $0 \leq r \leq 2n-2$ you can choose a subset of the blocks whose total weight is at least $r$ but at most $r + 2$.

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.

With inspiration drawn from the rectilinear network of streets in [i]New York[/i] , the [i]Manhattan distance[/i] between two points $(a,b)$ and $(c,d)$ in the plane is defined to be \[|a-c|+|b-d|\] Suppose only two distinct [i]Manhattan distance[/i] occur between all pairs of distinct points of some point set. What is the maximal number of points in such a set?

Estimate the value of $e^f$ , where $f = e^e$ .