Found problems: 1671
Let $\mathbb{Q}$ be the set of rational numbers. A function $f: \mathbb{Q} \to \mathbb{Q}$ is called aquaesulian if the following property holds: for every $x,y \in \mathbb{Q}$,
\[ f(x+f(y)) = f(x) + y \quad \text{or} \quad f(f(x)+y) = x + f(y). \]
Show that there exists an integer $c$ such that for any aquaesulian function $f$ there are at most $c$ different rational numbers of the form $f(r) + f(-r)$ for some rational number $r$, and find the smallest possible value of $c$.
Let $ a,b,c,d$ be real numbers with sum 0. Prove the inequality:
\[ (ab \plus{} ac \plus{} ad \plus{} bc \plus{} bd \plus{} cd)^2 \plus{} 12\geq 6(abc \plus{} abd \plus{} acd \plus{} bcd).
\]
Let $ a_1, a_2, ..., a_{300}$ be nonnegative real numbers, with $ \sum_{i\equal{}1}^{300} a_i \equal{} 1$.
Find the maximum possible value of $ \sum_{i \neq j, i|j} a_ia_j$.
[b]a)[/b] Let $ \left( x_n \right)_{n\ge 1} $ be a sequence of real numbers having the property that $ \left| x_{n+1} -x_n \right|\leqslant 1/2^n, $ for any $ n\geqslant 1. $
Show that $ \left( x_n \right)_{n\ge 1} $ is convergent.
[b]b)[/b] Create a sequence $ \left( y_n \right)_{n\ge 1} $ of real numbers that has the following properties:
$ \text{(i) } \lim_{n\to\infty } \left( y_{n+1} -y_n \right) = 0 $
$ \text{(ii) } $ is bounded
$ \text{(iii) } $ is divergent
[i]Eugen Popa[/i]
Given six positive numbers $a,b,c,d,e,f$ such that $a < b < c < d < e < f.$ Let $a+c+e=S$ and $b+d+f=T.$ Prove that
\[2ST > \sqrt{3(S+T)\left(S(bd + bf + df) + T(ac + ae + ce) \right)}.\]
[i]Proposed by Sung Yun Kim, South Korea[/i]
Prove that for all positive real numbers $a$, $b$, and $c$,
\[ \frac{a^3}{bc} + \frac{b^3}{ca} + \frac{c^3}{ab} \geq a+b+c \]
and determine when equality occurs.
Prove that if \( a \), \( b \), and \( c \) are positive real numbers, then the following inequality holds:
\[
\frac{a + 3c}{a + b} + \frac{c + 3a}{b + c} + \frac{4b}{c + a} \geq 6.
\]
Prove the inequality
$\frac{b^2+c^2-a^2}{a\left(b+c\right)}+\frac{c^2+a^2-b^2}{b\left(c+a\right)}+\frac{a^2+b^2-c^2}{c\left(a+b\right)}\geq\frac32$
for any three positive reals $a$, $b$, $c$.
[i]Comment.[/i] This was an attempt of creating a contrast to the (rather hard) inequality at the QEDMO before. However, it turned out to be more difficult than I expected (a wrong solution was presented during the competition).
Darij
Suppose that in a certain society, each pair of persons can be classified as either [i]amicable [/i]or [i]hostile[/i]. We shall say that each member of an amicable pair is a [i]friend[/i] of the other, and each member of a hostile pair is a [i]foe[/i] of the other. Suppose that the society has $\, n \,$ persons and $\, q \,$ amicable pairs, and that for every set of three persons, at least one pair is hostile. Prove that there is at least one member of the society whose foes include $\, q(1 - 4q/n^2) \,$ or fewer amicable pairs.
Prove that $$\frac{\sin^3 a}{\sin b} +\frac{\cos^3 a}{\cos b} \ge \frac{1}{\cos(a - b)}$$ for all $a$ and $b$ in the interval $(0, \pi/2)$ .
Let $ ABC$ be an acute angled triangle and let $ H$ be its ortho centre. Let $ h_{max}$ denote the largest altitude of the triangle $ ABC$. Prove that:
$AH \plus{} BH \plus{} CH\leq2h_{max}$
Prove or disprove that $\forall a,b,c,d \in \mathbb{R}^+$ we have the following inequality:
\[3 \leq \frac{4a+b}{a+4b} + \frac{4b+c}{b+4c} + \frac{4c+a}{c+4a} < \frac{33}{4}\]
Find all positive integers $n$ such that for all real numbers $x_1,x_2,\ldots ,x_n,y_1,y_2,\ldots ,y_n$ the following inequality holds:
\[ x_1x_2\ldots x_n+y_1y_2\ldots y_n\le\sqrt{x_1^2+y_1^2}\cdot\sqrt{x_2^2+y_2^2}\cdot \cdots \sqrt{x_n^2+y_n^2}\cdot \]
The sum of several positive numbers is equal to $10$, and the sum of their squares is greater than $20$. Prove that the sum of the cubes of these numbers is greater than $40$.
[i](5 points)[/i]
The sequence ${a_1, a_2, ..., a_{2019}}$ satisfies the following condition.
$a_1=1, a_{n+1}=2019a_{n}+1$
Now let $x_1, x_2, ..., x_{2019}$ real numbers such that $x_1=a_{2019}, x_{2019}=a_1$ (The others are arbitary.)
Prove that $\sum_{k=1}^{2018} (x_{k+1}-2019x_k-1)^2 \ge \sum_{k=1}^{2018} (a_{2019-k}-2019a_{2020-k}-1)^2$
Find all functions $f : \mathbb{R} \longrightarrow \mathbb{R}$ such that \[ f(x^2 + yf(z)) = xf(x) + zf(y) , \] for all $x, y, z \in \mathbb{R}$.
$\{a_{n}\}$ is a sequence of natural numbers satisfying the following inequality for all natural number $n$:
$$(a_{1}+\cdots+a_{n})\left(\frac{1}{a_{1}}+\cdots+\frac{1}{a_{n}}\right)\le{n^{2}}+2019$$
Prove that $\{a_{n}\}$ is constant.
Let $p$ be a prime, and let $a_1, \dots, a_p$ be integers. Show that there exists an integer $k$ such that the numbers
\[a_1 + k, a_2 + 2k, \dots, a_p + pk\]
produce at least $\tfrac{1}{2} p$ distinct remainders upon division by $p$.
[i]Proposed by Ankan Bhattacharya[/i]
Find all functions $f : \mathbb Z \to \mathbb Z$ such that $$(f(x + y))^2 = f(x^2) + f(y^2)$$ for all $x, y \in \mathbb Z$.
Let $ n$ be a positive integer and let $ a_1,a_2,\ldots,a_n$ be positive real numbers such that:
\[ \sum^n_{i \equal{} 1} a_i \equal{} \sum^n_{i \equal{} 1} \frac {1}{a_i^2}.
\]
Prove that for every $ i \equal{} 1,2,\ldots,n$ we can find $ i$ numbers with sum at least $ i$.
Let $ a,b,c,d$ be nonnegative real numbers. Prove that
\[ a^4\plus{}b^4\plus{}c^4\plus{}d^4\plus{}2abcd \ge a^2b^2\plus{}a^2c^2\plus{}a^2d^2\plus{}b^2c^2\plus{}b^2d^2\plus{}c^2d^2.\]
Show that if $ h_A, h_B,$ and $ h_C$ are the altitudes of $ \triangle ABC$, and $ r$ is the radius of the incircle, then $$ h_A + h_B + h_C \ge 9r$$
Assume $f:\mathbb N_0\to\mathbb N_0$ is a function such that $f(1)>0$ and, for any nonnegative integers $m$ and $n$,
$$f\left(m^2+n^2\right)=f(m)^2+f(n)^2.$$(a) Calculate $f(k)$ for $0\le k\le12$.
(b) Calculate $f(n)$ for any natural number $n$.
Katie has a list of real numbers such that the sum of the numbers on her list is equal to the sum of the squares of the numbers on her list. Compute the largest possible value of the arithmetic mean of her numbers.
[i]Proposed by Michael Ren[/i]
Each positive integer is coloured red or blue. A function $f$ from the set of positive integers to itself has the following two properties:
(a) if $x\le y$, then $f(x)\le f(y)$; and
(b) if $x,y$ and $z$ are (not necessarily distinct) positive integers of the same colour and $x+y=z$, then $f(x)+f(y)=f(z)$.
Prove that there exists a positive number $a$ such that $f(x)\le ax$ for all positive integers $x$.
[i](United Kingdom) Ben Elliott[/i]