Olympiad problems

AND:

OR:

NO:

Found problems: 2

2024 China Team Selection Test, 18

Let $m,n\in\mathbb Z_{\ge 0},$ $a_0,a_1,\ldots ,a_m,b_0,b_1,\ldots ,b_n\in\mathbb R_{\ge 0}$ For any integer $0\le k\le m+n,$ define $c_k:=\max_{i+j=k}a_ib_j.$ Proof $$\frac 1{m+n+1}\sum_{k=0}^{m+n}c_k\ge\frac 1{(m+1)(n+1)}\sum_{i=0}^{m}a_i\sum_{j=0}^{n}b_j.$$ [i]Created by Yinghua Ai[/i]

2021 USEMO, 6

Tags: inequalities , USEMO , USEMO 2021 , conbinatorics

A bagel is a loop of $2a+2b+4$ unit squares which can be obtained by cutting a concentric $a\times b$ hole out of an $(a +2)\times (b+2)$ rectangle, for some positive integers a and b. (The side of length a of the hole is parallel to the side of length $a+2$ of the rectangle.) Consider an infinite grid of unit square cells. For each even integer $n \ge 8$, a bakery of order $n$ is a finite set of cells $ S$ such that, for every $n$-cell bagel $B$ in the grid, there exists a congruent copy of $B$ all of whose cells are in $S$. (The copy can be translated and rotated.) We denote by $f(n)$ the smallest possible number of cells in a bakery of order $ n$. Find a real number $\alpha$ such that, for all sufficiently large even integers $n \ge 8$, we have $$\frac{1}{100}<\frac{f (n)}{n^ {\alpha}}<100$$ [i]Proposed by Nikolai Beluhov[/i]