Let $\mathcal F$ be the set of functions $f(x,y)$ that are twice continuously differentiable for $x\geq 1$, $y\geq 1$ and that satisfy the following two equations (where subscripts denote partial derivatives): \[xf_x + yf_y = xy\ln(xy),\] \[x^2f_{xx} + y^2f_{yy} = xy.\] For each $f\in\mathcal F$, let \[ m(f) = \min_{s\geq 1}\left(f(s+1,s+1) - f(s+1,s)-f(s,s+1) + f(s,s)\right). \] Determine $m(f)$, and show that it is independent of the choice of $f$.

Tomek invited to a remote birthday part $11$ of his friends who will join the meeting one by one. Tomek chose the guests in such a way that, regardless of the order in which they will join, always the newcomer knew at least half of the people already present, including Tomek. Prove that among of invited guests, there is one who knows all of Tom's other $10$ friends. Caution: We assume that if person A knows person $B$, then $B$ also knows $A$. [hide=original wording]Tomek zaprosił na zdalne przyjęcie urodzinowe 11 swoich znajomych, którzy kolejno będą dołączać do spotkania. Tomek dobrał gości w taki sposób, aby niezależnie od kolejności w jakiej będą dołączać, zawsze nowo przybyła osoba znała co najmniej połowę już obecnych osób, wliczając Tomka. Wykaż, że wśród zaproszonych gości istnieje taki, który zna wszystkich pozostałych 10 znajomych Tomka. Uwaga: Przyjmujemy, że jeśli osoba A zna osobę B, to również B zna A.[/hide]

Does there exist a positive integer $N$ which is divisible by at least $2024$ distinct primes and whose positive divisors $1 = d_1 < d_2 < \ldots < d_k = N$ are such that the number \[ \frac{d_2}{d_1}+\frac{d_3}{d_2}+\ldots+\frac{d_k}{d_{k-1}} \] is an integer?

Yang has the sequence of integers $1, 2, \dots, 2017$. He makes $2016$ [i]swaps[/i] in order, where a swap changes the positions of two integers in the sequence. His goal is to end with $2, 3, \dots, 2017, 1$. How many different sequences of swaps can Yang do to achieve his goal?

Bilbo, Gandalf, and Nitzan play the following game. First, Nitzan picks a whole number between $1$ and $2^{2022}$ inclusive and reveals it to Bilbo. Bilbo now compiles a string of length $4044$ built from the three letters $a,b,c$. Nitzan looks at the string, chooses one of the three letters $a,b,c$, and removes from the string all instances of the chosen letter. Only then is the string revealed to Gandalf. He must now guess the number Nitzan chose. Can Bilbo and Gandalf work together and come up with a strategy beforehand that will always allow Gandalf to guess Nitzan's number correctly, no matter how he acts?

Let $ABCDEFGHI$ be a regular polygon of $9$ sides. The segments $AE$ and $DF$ intersect at $P$. Prove that $PG$ and $AF$ are perpendicular.

For any continuous real-valued function $f$ defined on the interval $[0,1],$ let \[\mu(f)=\int_0^1f(x)\,dx,\text{Var}(f)=\int_0^1(f(x)-\mu(f))^2\,dx, M(f)=\max_{0\le x\le 1}|f(x)|.\] Show that if $f$ and $g$ are continuous real-valued functions defined on the interval $[0,1],$ then \[\text{Var}(fg)\le 2\text{Var}(f)M(g)^2+2\text{Var}(g)M(f)^2.\]

Prove that for all positive real numbers $a,b,c$ the following inequality holds: \[(a+b+c)\left(\frac1a+\frac1b+\frac1c\right)\ge\frac{2(a^2+b^2+c^2)}{ab+bc+ca}+7\] and determine all cases of equality. [i]Lucian Petrescu[/i]

An ellipse $\Gamma_1$ with foci at the midpoints of sides $AB$ and $AC$ of a triangle $ABC$ passes through $A$, and an ellipse $\Gamma_2$ with foci at the midpoints of $AC$ and $BC$ passes through $C$. Prove that the common points of these ellipses and the orthocenter of triangle $ABC$ are collinear.

Let $a_1,a_2,\cdots ,a_9$ be $9$ positive integers (not necessarily distinct) satisfying: for all $1\le i<j<k\le 9$, there exists $l (1\le l\le 9)$ distinct from $i,j$ and $j$ such that $a_i+a_j+a_k+a_l=100$. Find the number of $9$-tuples $(a_1,a_2,\cdots ,a_9)$ satisfying the above conditions.

Solve the equation: $\log_{x} 2 \cdot \log_{2x} 2 = \log_{4x} 2$.

$f(n)$ denotes the largest integer $k$ such that that $2^k|n$. $2006$ integers $a_i$ are such that $a_1<a_2<...<a_{2016}$. Is it possible to find integers $k$ where $1 \le k\le 2006$ and $f(a_i-a_j)\ne k$ for every $1 \le j \le i \le 2006$ ?

Find all $k>0$ such that there exists a function $f : [0,1]\times[0,1] \to [0,1]$ satisfying the following conditions: $f(f(x,y),z)=f(x,f(y,z))$; $f(x,y) = f(y,x)$; $f(x,1)=x$; $f(zx,zy) = z^{k}f(x,y)$, for any $x,y,z \in [0,1]$

Let $\{x_n\}_{n=1}^\infty$ be a sequence such that $x_1=25$, $x_n=\operatorname{arctan}(x_{n-1})$. Prove that this sequence has a limit and find it.

A parabola with equation $ y \equal{} x^2 \plus{} bx \plus{} c$ passes through the points $ (2,3)$ and $ (4,3)$. What is $ c$? $ \textbf{(A) } 2 \qquad \textbf{(B) } 5 \qquad \textbf{(C) } 7 \qquad \textbf{(D) } 10 \qquad \textbf{(E) } 11$

Let $f(x)$ be a periodic function of period $T > 0$ defined over $\mathbb R$. Its first derivative is continuous on $\mathbb R$. Prove that there exist $x, y \in [0, T )$ such that $x \neq y$ and \[f(x)f'(y)=f'(x)f(y).\]

Prove that the product of all integers from $2^{1917} +1$ up to $2^{1991} -1$ is not the square of an integer. (V. Senderov, Moscow)

Alex starts with a rooted tree with one vertex (the root). For a vertex $v$, let the size of the subtree of $v$ be $S(v)$. Alex plays a game that lasts nine turns. At each turn, he randomly selects a vertex in the tree, and adds a child vertex to that vertex. After nine turns, he has ten total vertices. Alex selects one of these vertices at random (call the vertex $v_1$). The expected value of $S(v_1)$ is of the form $\tfrac{m}{n}$ for relatively prime positive integers $m, n$. Find $m+n$. [b]Note:[/b] In a rooted tree, the subtree of $v$ consists of its indirect or direct descendants (including $v$ itself). [i]Proposed by Yang Liu[/i]

Joyce made $12$ of her first $30$ shots in the first three games of this basketball game, so her seasonal shooting average was $40\% $. In her next game, she took $10$ shots and raised her seasonal shooting average to $50\% $. How many of these $10$ shots did she make? $\text{(A)}\ 2 \qquad \text{(B)}\ 3 \qquad \text{(C)}\ 5 \qquad \text{(D)}\ 6 \qquad \text{(E)}\ 8$

A [i]uniform covering[/i] of the integers $1,2,...,n$ is a finite multiset of subsets of $\{1,2,...,n\}$, so that each number lies in the same amount of sets from the covering. A covering may contain the same subset multiple times, it must contain at least one subset, and it may contain the empty subset. For example, $(\{1\},\{1\},\{2,3\},\{3,4\},\{2,4\})$ is a uniform covering of $1,2,3,4$ (every number occurs in two sets). The covering containing only the empty set is also uniform (every number occurs in zero sets). Given two uniform coverings, we define a new uniform covering, their [i]sum[/i] (denoted by $\oplus$), by adding the sets from both coverings. For example: $(\{1\},\{1\},\{2,3\},\{3,4\},\{2,4\})\oplus(\{1\},\{2\},\{3\},\{4\})=$ $(\{1\},\{1\},\{1\},\{2\},\{3\},\{4\},\{2,3\},\{3,4\},\{2,4\})$ A uniform covering is called [i]non-composite[/i] if it's not a sum of two uniform coverings. Prove that for any $n\geq1$, there are only finitely many non-composite uniform coverings of $1,2,...,n$.

A rectangular checkered board is painted black and white as a chessboard, and is tiled by dominoes $1 \times 2$. If a horizontal and a vertical dominoes have common segment, it has a door which has the color of the adjoining cell of the domino adjacent by a short side. Is it necessarily true that the number of white doors equals the number of black doors?

Let $ABC$ be an acute-angled triangle with circumcenter $O$ and incenter $I$. The midpoint of arc $BC$ of the circumcircle of $ABC$ not containing $A$ is denoted $S$. Points $E, F$ were chosen on line $OI$ for which $BE$ and $CF$ are both perpendicular to $OI$. Point $X$ was chosen so that $XE\perp AC$ and $XF\perp AB$. Point $Y$ was chosen so that $YE\perp SC$ and $YF\perp SB$. $D$ was chosen on $BC$ so that $DI\perp BC$. Prove that $X$, $Y$, and $D$ are collinear.

Find the sum of the decimal digits of the number \[ 5\sum_{k=1}^{99} k(k + 1)(k^2 + k + 1). \] [i]Proposed by Robin Park[/i]

Ana and Bojan are playing a game: Ana chooses positive integers $a$ and $b$ and each one gets $2016$ pieces of paper, visible to both - Ana gets the pieces with the numbers $a+1$, $a+2$, $\ldots$, $a+2016$ and Bojan gets the pieces with the numbers $b+1$, $b+2$, $\ldots$, $b+2016$ on them. Afterwards, one of them writes the number $a+b$ on the board. In every move, Ana chooses one of her pieces of paper and hands it to Bojan who chooses one of his own, writes their sum on the board and removes them both from the game. When they run out of pieces, they multiply the numbers on the board together. If the result has the same remainder than $a+b$ when divided by $2017$, Bojan wins, otherwise, Ana wins. Who has the winning strategy?

Two perpendicular lines pass through the orthocenter of an acute-angled triangle. The sidelines of the triangle cut on each of these lines two segments: one lying inside the triangle and another one lying outside it. Prove that the product of two internal segments is equal to the product of two external segments. [i]Nikolai Beluhov and Emil Kolev[/i]