Given that the equation $(m^2-12)x^4-8x^2-4=0$ has no real roots, then the largest value of $m$ is $p\sqrt{q}$, where $p$ and $q$ are natural numbers, $q$ is square-free. Determine $p+q$. (A)$4$ (B)$5$ (C)$3$ (D)$6$

Prove that $\frac{a^3}{bc} + \frac{b^3}{ca} + \frac{c^3}{ba} \ge a + b + c$, for all positive real numbers $a, b$, and $c$.

Find all polynomials $P(x)$ which have the properties: 1) $P(x)$ is not a constant polynomial and is a mononic polynomial. 2) $P(x)$ has all real roots and no duplicate roots. 3) If $P(a)=0$ then $P(a|a|)=0$ [i](nooonui)[/i]

Determine all the functions $f : \mathbb{R}\rightarrow\mathbb{R}$ that satisfies the following. $f(xf(x)+f(x)f(y)+y-1)=f(xf(x)+xy)+y-1$

Let $f$ be a function that associates a positive integer $(x, y)$ with each pair of positive integers $f(x, y)$. Suppose that $f(x, y) \le xy$ for all positive integers $x$, $y$. Show that there are $2023$ different pairs $(x_1, y_1)$,$...$, $ (x_{2023}, y_{2023}$) such that $$f(x_1, y_1) = f(x_2, y_2) = ....= f(x_{2023}, y_{2023}).$$

Let $ p=\sum\limits_{k=0}^n a_kX^k\in R[X] $ a polynomial such that all his roots lie in the half plane $ \{z\in C| Re(z)<0 \}. $ Prove that $ a_ka_{k+3}<a_{k+1}a_{k+2}, $ for every k=0,1,2...,n-3.

Find all (real) solutions of the system \[3x_1-x_2-x_3-x_5 = 0,\]\[-x_1+3x_2-x_4-x_6= 0,\]\[-x_1 + 3x_3 - x_4 - x_7 = 0,\]\[-x_2 - x_3 + 3x_4 - x_8 = 0,\]\[-x_1 + 3x_5 - x_6 - x_7 = 0,\]\[-x_2 - x_5 + 3x_6 - x_8 = 0,\]\[-x_3 - x_5 + 3x_7 - x_8 = 0,\]\[-x_4 - x_6 - x_7 + 3x_8 = 0.\]

Egor and Igor take turns (Igor starts) replacing the coefficients of the polynomial \[a_{99}x^{99} + \cdots + a_1x + a_0\]with non-zero integers. Egor wants the polynomial to have as many different integer roots as possible. What is the largest number of roots he can always achieve?

Let $k > 2$ be a real number. a) Prove that for all positive real numbers $x,y$ and $z$ the following inequality holds: $$\sqrt{x + y }+\sqrt{y + z }+\sqrt{z + x} > 2\sqrt{\frac{(x + y)(y + z)(z + x)}{xy + yz + zx}}$$ b) Prove that there exist positive real numbers $x, y$ and $z$ such that $$\sqrt{x + y }+\sqrt{y + z}+\sqrt{z + x} <k\sqrt{\frac{(x + y)(y + z)(z + x)}{xy + yz + zx}}$$ Leonard Giugiuc

$f$ is a function from the set of positive integers to the set of all integers that satisfies the following. [b]$\cdot$[/b] $f(1)=1, f(2)=-1$ [b]$\cdot$[/b] $f(n)+f(n+1)+f(n+2)=f(\left\lfloor\frac{n+2}{3}\right\rfloor)$ Find the number of positive integers $k$ not exceeding $1000$ such that $f(3)+f(6)+\cdots+f(3k-3)+f(3k)=5$.

Prove that if two cubic polynomials with integer coefficients have an irrational root in common, then they have another common irrational root.

A survey of participants was conducted at the Olympiad. $50\%$ of the participants liked the first round, $60\%$ of the participants liked the second round, $70\%$ of the participants liked the opening of the Olympiad. It is known that each participant liked either one option or all three. Determine the percentage of participants who rated all three events positively.

The sequence $a_1,a_2…$ , is defined by the equations $a_1=1$ and $a_n=n.a_{[n/2]}$ for $n>1$. Prove that $a_n>n^2$ for $n>11$.

Let $f$ be an irreducible (in $Z[x]$) monic polynomial with integer coefficients and of odd degree greater than $1$. Suppose that the modules of the roots of $f$ are greater than $1$ and that $f(0)$ is a square-free number. Prove that the polynomial $g(x) = f(x^3)$ is also irreducible

Prove that the equation x^3- x- 3 = 0 has a unique root. Which is greater, the root of this equation or $\sqrt[5]{13}$? (Use of a calculator is prohibited.)

Find all polynomials $P,Q \in Z[x]$ such that every positive integer is a divisor of a certain nonzero term of the sequence $(x_n)_{n=0}^{\infty}$ given by the conditions: $x_0 = 2016$, $x_{2n+1} = P(x_{2n})$, $x_{2n+2} = Q(x_{2n+1})$ for all $n \ge 0$

Given a sequence $a_0, a_1, a_2, ... , a_n$, let its [i]arithmetic approximant[/i] be the arithmetic sequence $b_0, b_1, ... , b_n$ that minimizes the quantity $\sum_{i=0}^{n}(b_i -a_i)^2$, and denote this quantity the sequence’s anti-arithmeticity. Denote the number of integer sequences whose arithmetic approximant is the sequence $4$, $8$, $12$, $16$ and whose anti-arithmeticity is at most $20$.

Solve the system of equations for variables $x,y$, where $\{a,b\}\in\mathbb{R}$ are constants and $a\neq 0$. \[x^2 + xy = a^2 + ab\] \[y^2 + xy = a^2 - ab\]

Let $f: \mathbb R \to \mathbb R$ and $g: \mathbb R \to \mathbb R$ be two functions satisfying \[\forall x,y \in \mathbb R: \begin{cases} f(x+y)=f(x)f(y),\\ f(x)= x g(x)+1\end{cases} \quad \text{and} \quad \lim_{x \to 0} g(x)=1.\] Find the derivative of $f$ in an arbitrary point $x.$

Let \( \mathbb{R} \) be the set of real numbers. Determine all functions \( f: \mathbb{R} \to \mathbb{R} \) such that, for any real numbers \( x \) and \( y \), \[ f(x^2 y - y) = f(x)^2 f(y) + f(x)^2 - 1. \]

Show that a sequence $(a_n)$ of $+1$ and $-1$ is periodic with period a power of $2$ if and only if $a_n=(-1)^{P(n)}$, where $P$ is an integer-valued polynomial with rational coefficients.

For a sequence $x_1,x_2,\ldots,x_n$ of real numbers, we define its $\textit{price}$ as \[\max_{1\le i\le n}|x_1+\cdots +x_i|.\] Given $n$ real numbers, Dave and George want to arrange them into a sequence with a low price. Diligent Dave checks all possible ways and finds the minimum possible price $D$. Greedy George, on the other hand, chooses $x_1$ such that $|x_1 |$ is as small as possible; among the remaining numbers, he chooses $x_2$ such that $|x_1 + x_2 |$ is as small as possible, and so on. Thus, in the $i$-th step he chooses $x_i$ among the remaining numbers so as to minimise the value of $|x_1 + x_2 + \cdots x_i |$. In each step, if several numbers provide the same value, George chooses one at random. Finally he gets a sequence with price $G$. Find the least possible constant $c$ such that for every positive integer $n$, for every collection of $n$ real numbers, and for every possible sequence that George might obtain, the resulting values satisfy the inequality $G\le cD$. [i]Proposed by Georgia[/i]

Let $A$ and $B$ be arbitrary finite sets and let $f: A\longrightarrow B$ and $g: B\longrightarrow A$ be functions such that $g$ is not onto. Prove that there is a subset $S$ of $A$ such that $\frac{A}{S}=g(\frac{B}{f(S)})$.

For all positive integers $n,$ let $r_n$ be defined as \[r_n=\sum_{i=0}^n(-1)^i\binom{n}{i}\frac{1}{(i+1)!}.\]Prove that $\sum_{r=1}^\infty r_i=0.$

Find all real numbers $a,b$ satisfying the following system of equations \begin{align*} 2a^2 -2ab+b^2 &=a\\ 4a^2 -5ab +2b^2 & =b. \end{align*}