For each positive integer $n$, find the largest real number $C_n$ with the following property. Given any $n$ real-valued functions $f_1(x), f_2(x), \cdots, f_n(x)$ defined on the closed interval $0 \le x \le 1$, one can find numbers $x_1, x_2, \cdots x_n$, such that $0 \le x_i \le 1$ satisfying \[|f_1(x_1)+f_2(x_2)+\cdots f_n(x_n)-x_1x_2\cdots x_n| \ge C_n\] [i]Marko Radovanović, Serbia[/i]

Quadratic trinomials with positive leading coefficients are arranged in the squares of a $6 \times 6$ table. Their $108$ coefficients are all integers from $-60$ to $47$ (each number is used once). Prove that at least in one column the sum of all trinomials has a real root. [i]K. Kokhas & F. Petrov[/i]

A teen age boy wrote his own age after his father's. From this new four place number, he subtracted the absolute value of the difference of their ages to get $4,289$. The sum of their ages was $\textbf{(A) }48\qquad\textbf{(B) }52\qquad\textbf{(C) }56\qquad\textbf{(D) }59\qquad \textbf{(E) }64$

Find all triples $(x, y, z)$ of real numbers that satisfy $x^2 + y^2 + z^2 + 1 = xy + yz + zx +|x - 2y + z|$.

There is a table with $n > 2$ cells in the first row, $n-1$ cells in the second row is a cell, $n-2$ in the third row, $\ldots$, $1$ cell in the $n$-th row. The cells are arranged as shown below. [img]https://i.ibb.co/0Z1CR0c/UMO24-8-2.png[/img] In each cell of the top row Petryk writes a number from $1$ to $n$, so that each number is written exactly once. For each other cell, if the cells directly above it contains numbers $a, b$, it contains number $|a-b|$. What is the largest number that can be written in a single cell of the bottom row? [i]Proposed by Bogdan Rublov[/i]

Suppose that $|x+y|+|x-y|=2$. What is the maximum possible value of $x^2-6x+y^2$? $ \textbf{(A)}\ 5 \qquad \textbf{(B)}\ 6 \qquad \textbf{(C)}\ 7 \qquad \textbf{(D)}\ 8 \qquad \textbf{(E)}\ 9 $

The graph of $f(x) = |\lfloor x \rfloor| - |\lfloor 1 - x \rfloor|$ is symmetric about which of the following? (Here $\lfloor x \rfloor$ is the greatest integer not exceeding $x$.) $\textbf{(A) }$ the $y$-axis $\qquad \textbf{(B) }$ the line $x = 1$ $\qquad \textbf{(C) }$ the origin $\qquad \textbf{(D) }$ the point $\left(\dfrac12, 0\right)$ $\qquad \textbf{(E) }$ the point $(1,0)$

A sample of 121 integers is given, each between 1 and 1000 inclusive, with repetitions allowed. The sample has a unique mode (most frequent value). Let $D$ be the difference between the mode and the arithmetic mean of the sample. What is the largest possible value of $\lfloor D\rfloor$? (For real $x$, $\lfloor x\rfloor$ is the greatest integer less than or equal to $x$.)

How many ordered pairs of real numbers $(x,y)$ satisfy the following system of equations? \begin{align*}x+3y&=3\\ \big||x|-|y|\big|&=1\end{align*} $\textbf{(A) } 1 \qquad \textbf{(B) } 2 \qquad \textbf{(C) } 3 \qquad \textbf{(D) } 4 \qquad \textbf{(E) } 8 $

Let $f\in\mathbb{Z}[X]$ be an irreducible polynomial over the ring of integer polynomials, such that $|f(0)|$ is not a perfect square. Prove that if the leading coefficient of $f$ is 1 (the coefficient of the term having the highest degree in $f$) then $f(X^2)$ is also irreducible in the ring of integer polynomials. [i]Mihai Piticari[/i]

Find the positive constant $c_0$ such that the series \[ \displaystyle\sum_{n = 0}^{\infty} \dfrac {n!}{(cn)^n} \] converges for $c>c_0$ and diverges for $0<c<c_0$.

What is the sum of all the solutions of $ x \equal{} |2x \minus{} |60\minus{}2x\parallel{}$? $ \textbf{(A)}\ 32\qquad\textbf{(B)}\ 60\qquad\textbf{(C)}\ 92\qquad\textbf{(D)}\ 120\qquad\textbf{(E)}\ 124$

Let $F(x,y)$ and $G(x,y)$ be relatively prime homogeneous polynomials of degree at least one having integer coefficients. Prove that there exists a number $c$ depending only on the degrees and the maximum of the absolute values of the coefficients of $F$ and $G$ such that $F(x,y)\neq G(x,y)$ for any integers $x$ and $y$ that are relatively prime and satisfy $\max \{ |x|,|y|\} > c$. [K. Gyory]

The sequence of functions $f_0,f_1,f_2,...$ is given by the conditions: $f_0(x) = |x|$ for all $x \in R$ $f_{n+1}(x) = |f_n(x)-2|$ for $n=0,1,2,...$ and all $x \in R$. For each positive integer $n$, solve the equation $f_n(x)=1$.

Find the complex numbers $ z_1,z_2,z_3 $ of same absolute value having the property that: $$ 1=z_1z_2z_3=z_1+z_2+z_3. $$

For a positive integer $p$, define the positive integer $n$ to be $p$-safe if $n$ differs in absolute value by more than $2$ from all multiples of $p$. For example, the set of $10$-safe numbers is $\{3, 4, 5, 6, 7, 13, 14, 15, 16, 17,23, \ldots \}$. Find the number of positive integers less than or equal to $10,000$ which are simultaneously $7$-safe, $11$-safe, and $13$-safe.·

Find the smallest and largest values of the expression $$\frac{ \left| ...\left| |x-1|-1\right| ... -1\right| +1}{\left| |x-2|-1 \right|+1}$$ (The number of units in the numerator of a fraction, including the last one, is eleven, of which ten are under the absolute value sign.)

How many integers $x$ satisfy $|x|+5<7$ and $|x-3|>2$?

Determine all real numbers $ a$ such that the inequality $ |x^2 \plus{} 2ax \plus{} 3a|\le2$ has exactly one solution in $ x$.

Let $f(x)$ be a polynomial. Prove that if $\int_0^1 f(x)g_n(x)\ dx=0\ (n=0,\ 1,\ 2,\ \cdots)$, then all coefficients of $f(x)$ are 0 for each case as follows. (1) $g_n(x)=(1+x)^n$ (2) $g_n(x)=\sin n\pi x$ (3) $g_n(x)=e^{nx}$

In a $ 19\times 19$ board, a piece called [i]dragon[/i] moves as follows: It travels by four squares (either horizontally or vertically) and then it moves one square more in a direction perpendicular to its previous direction. It is known that, moving so, a dragon can reach every square of the board. The [i]draconian distance[/i] between two squares is defined as the least number of moves a dragon needs to move from one square to the other. Let $ C$ be a corner square, and $ V$ the square neighbor of $ C$ that has only a point in common with $ C$. Show that there exists a square $ X$ of the board, such that the draconian distance between $ C$ and $ X$ is greater than the draconian distance between $ C$ and $ V$.

There are $n$ points on a circle, such that each line segment connecting two points is either red or blue. $P_iP_j$ is red if and only if $P_{i+1} P_{j+1}$ is blue, for all distinct $i, j$ in $\left\{1, 2, ..., n\right\}$. (a) For which values of $n$ is this possible? (b) Show that one can get from any point on the circle to any other point, by doing a maximum of 3 steps, where one step is moving from a point to another point through a red segment connecting these points.

Find all real numbers $a$ for which the following equation has a unique real solution: $$|x-1|+|x-2|+\ldots+|x-99|=a.$$

Let $P(x), Q(x), R(x)$ be polynomials with integer coefficients, such that $P(x) = Q(x)R(x)$. Let's denote by $a$ and $b$ the largest absolute values of coefficients of $P, Q$ correspondingly. Does $b \le 2023a$ always hold? [i]Proposed by Dmytro Petrovsky[/i]

Prove that for $n>1$ and real numbers $a_0,a_1,\dots, a_n,k$ with $a_1=a_{n-1}=0$, \[|a_0|-|a_n|\leq \sum_{i=0}^{n-2}|a_i-ka_{i+1}-a_{i+2}|.\]