Let $x$ be the largest root of $x^4 - 2009x + 1$. Find the nearest integer to $\frac{1}{x^3-2009}$ .

Find all triples $(a,b,c)$ of real numbers for which there exists a function $f:\mathbb{Z}^{+}\rightarrow\mathbb{Z}^{+}$ satisfying $af(n)+bf(n+1)+cf(n+2)<0$ for every $n\in\mathbb{Z}^{+}$ ($\mathbb{Z}^{+}$ denotes the set of positive integers). Proposed by [i]András Imolay[/i], Budapest

Find all the functions $\varphi:\mathbb{Z}[x]\to\mathbb{Z}[x]$ such that $\varphi(x)=x,$ any integer polynomials $f, g$ satisfy $\varphi(f+g)=\varphi(f)+\varphi(g)$ and $\varphi(f)$ is a perfect power if and only if $f{}$ is a perfect power. [i]Note:[/i] A polynomial $f\in \mathbb{Z}[x]$ is a perfect power if $f = g^n$ for some $g\in \mathbb{Z}[x]$ and $n\geqslant 2.$ [i]Proposed by Pavel Ciurea[/i]

Find the sum of all positive integers $B$ such that $(111)_B=(aabbcc)_6$, where $a,b,c$ represent distinct base $6$ digits, $a\neq 0$.

A softball team played ten games, scoring $1,2,3,4,5,6,7,8,9$, and $10$ runs. They lost by one run in exactly five games. In each of the other games, they scored twice as many runs as their opponent. How many total runs did their opponents score? $ \textbf {(A) } 35 \qquad \textbf {(B) } 40 \qquad \textbf {(C) } 45 \qquad \textbf {(D) } 50 \qquad \textbf {(E) } 55 $

Let $a,b,c$ be side lengths of a triangle with $a+b+c = 1$. Prove that $a^2 +b^2 +c^2 +4abc \le \frac12$ .

Let \( p \) be a monic polynomial with all distinct real roots. Show that there exists \( K \) such that \[ (p(x)^2)'' \leq K(p'(x))^2. \]

Find all functions \( f: \mathbb{R} \rightarrow \mathbb{R} \) such that for all \( x, y \in \mathbb{R} \), \[ f(x + f(2y)) + f(x^2 - y) = f(f(x)) f(x + 1) + 2y - f(y). \]

Prove that for natural number $n$ it's possible to find complex numbers $\omega_1,\omega_2,\cdots,\omega_n$ on the unit circle that $$\left\lvert\sum_{j=1}^{n}\omega_j\right\rvert=\left\lvert\sum_{j=1}^{n}\omega_j^2\right\rvert=n-1$$ iff $n=2$ occurs.

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]

Do there exist infinitely many positive integers $a, b$ such that $$(a^2+1)(b^2+1)((a+b)^2+1)$$ is a perfect square? [i]Proposed Ivan Chan Guan Yu[/i]

Determine the number of times and the positions in which it appears $\frac12$ in the following sequence of fractions: $$ \frac11, \frac21, \frac12 , \frac31 , \frac22 , \frac13 , \frac41,\frac32,\frac23,\frac14,..., \frac{1}{1992}$$

Real numbers $x, y$ satisfy the inequality $x^2 + y^2 \le 2$. Orove that $xy + 3 \ge 2x + 2y$

At Zoom University, people’s faces appear as circles on a rectangular screen. The radius of one’s face is directly proportional to the square root of the area of the screen it is displayed on. Haydn’s face has a radius of $2$ on a computer screen with area $36$. What is the radius of his face on a $16 \times 9$ computer screen?

Are there any real numbers $a,b,c$ such that $a+b+c=6$, $ab+bc+ca=9$ and $a^4+b^4+c^4=260$? What about if we let $a^4+b^4+c^4=210$? [i] (Andrei Bâra)[/i]

For any function $f:\mathbb{N}\to\mathbb{N}$ we define $P(n)=f(1)f(2)...f(n)$ . Find all functions $f:\mathbb{N}\to\mathbb{N}$ st for each $a,b$ : $$P(a)+P(b) | a! + b!$$

Find all functions $f : \mathbb{R} \rightarrow \mathbb{R}$ such that \[f(x+y) + f(x)f(y) = f(xy) + (y+1)f(x) + (x+1)f(y)\] for all $x,y \in \mathbb{R}$.

Let $P(x) = x^4 + ax^3 + bx^2 + x$ be a polynomial with four distinct roots that lie on a circle in the complex plane. Prove that $ab\ne 9$.

Let $ABC$ be a triangle and $k < 1$ a positive real number. Let $A_1$, $B_1$, $C_1$ be points on the sides $BC$, $AC$, $AB$ such that $$\frac{A_1B}{BC} = \frac{B_1C}{AC} = \frac{C_1A}{AB} = k.$$ [b](a)[/b] Compute, in terms of $k$, the ratio between the areas of the triangles $A_1B_1C_1$ and $ABC$. [b](b)[/b] Generally, for each $n \ge 1$, the triangle $A_{n+1}B_{n+1}C_{n+1}$ is built such that $A_{n+1}$, $B_{n+1}$, $C_{n+1}$ are points on the sides $B_nC_n$, $A_nC_n$ e $A_nB_n$ satisfying $$\frac{A_{n+1}B_n}{B_nC_n} = \frac{B_{n+1}C_n}{A_nC_n} = \frac{C_{n+1}A_n}{A_nB_n} = k.$$ Compute the values of $k$ such that the sum of the areas of every triangle $A_nB_nC_n$, for $n = 1, 2, 3, \dots$ is equal to $\dfrac{1}{3}$ of the area of $ABC$.

The polynomial \[P(x)=(1+x+x^2+\cdots+x^{17})^2-x^{17}\] has 34 complex roots of the form $z_k=r_k[\cos(2\pi a_k)+i\sin(2\pi a_k)], k=1, 2, 3,\ldots, 34$, with $0<a_1\le a_2\le a_3\le\cdots\le a_{34}<1$ and $r_k>0$. Given that $a_1+a_2+a_3+a_4+a_5=m/n$, where $m$ and $n$ are relatively prime positive integers, find $m+n$.

Of all the fractions $\frac{x}{y}$ that satisfy $$\frac{41}{2010}<\frac{x}{y}<\frac{1}{49}$$ find the one with the smallest denominator.

Define the sequence $s_0$, $s_1$, $s_2$,$ . . .$ by $s_0 = 0$ and $s_n = 3s_{n-1}+2$ for $n \ge 1$. The monic polynomial $f(x)$ defined as $$f(x) =\frac{1}{s_{2023}} \sum^{32}_{k=0} s_{2023+k}x^{32-k}$$ can be factored uniquely (up to permutation) as the product of $16$ monic quadratic polynomials $p_1$, $p_2$, $....$, $p_{16}$ with real coefficients, where $p_i(x) = x^2 + a_ix + b_i$ for $1\le i \le 16$. Compute the integer $N$ that minimizes $$\left|N - \sum^{16}_{k=1} (a_k + b_k)\right|.$$

The positive numbers $a, b, c$ are such that $a^2<16bc, b^2<16ca$ and $c^2<16ab$. Prove that \[a^2+b^2+c^2<2(ab+bc+ca).\]

A sequence of positive integers $(a_n)_{n \ge 1}$ is of [i]Fibonacci type[/i] if it satisfies the recursive relation $a_{n + 2} = a_{n + 1} + a_n$ for all $n \ge 1$. Is it possible to partition the set of positive integers into an infinite number of Fibonacci type sequences? [i]Proposed by Ivan Borsenco[/i]

Let $f:\mathbb{R}\to\mathbb{R}$ be a bijective function. Does there always exist an infinite number of functions $g:\mathbb{R}\to\mathbb{R}$ such that $f(g(x))=g(f(x))$ for all $x\in\mathbb{R}$? [i]Proposed by Daniel Liu[/i]