Inequalities

4 results

Middle European Mathematical Olympiad 2025 Problem I-1

Let R+\mathbb{R}^+ be the set of positive real numbers. Let f ⁣:R+R+f\colon \mathbb{R}^{+}\to \mathbb{R}^{+} be a function such that for all x,yR+x,y\in \mathbb{R}^{+} it holds that

yf2025(x)xf(y).y f^{2025}(x) \geq x f(y).

Show that there exists a positive integer n0n_0 such that for all positive integers nn0n \geq n_0 and for all xR+x \in \mathbb{R}^+ it holds that

fn(x)x.f^n(x) \geq x.

Remark. Here fnf^n denotes the function ff applied nn times, this means fn(x)=f(f(f(x)))n timesf^n(x) = \underbrace{f(f(\ldots f(x)\ldots))}_{n \text{ times}}.

Middle European Mathematical Olympiad 2025 Problem T-1

Bob has nn coins with integer values c1c2cn>0.c_1 \geq c_2 \geq \cdots \geq c_n > 0.

He is standing in front of a vending machine that offers nn candy bars with positive integer costs b1,b2,,bnb_1, b_2, \ldots, b_n. Bob notices that for every i{1,,n}i \in \{1, \ldots, n\}, it holds that b1+b2++bic1+c2++ci.b_1 + b_2 + \cdots + b_i \geq c_1 + c_2 + \cdots + c_i.

Furthermore, the total value of Bob's coins equals the sum of the costs of all the candy bars. The candy bars can be purchased in any order. In order to buy the ii-th candy bar, Bob has to insert coins of total value at least bib_i. However, the machine does not give him back any change.

Prove that Bob can buy at least half of the candy bars.

Grade 9 2026 Problem 2

Dokaži da za sve pozitivne realne brojeve aa, bb i cc za koje je aca \geqslant c i bcb \geqslant c vrijedi nejednakost c(ac)+c(bc)ab.\sqrt{c(a - c)} + \sqrt{c(b - c)} \leqslant \sqrt{ab}.

Grade 11 2024 Problem 4

Neka su aa i bb prirodni brojevi takvi da je 1<a<b1 < a < b i da vrijedi a+bab+1ibaab1.a + b \mid ab + 1 \quad \text{i} \quad b - a \mid ab - 1.

Dokaži da je b<a3b < a\sqrt{3}.