Let $n$ be a positive integer. Marc has $2n$ boxes, and in particular, he has one box filled with $k$ apples for each $k=1,2,3,\ldots,2n$. Every day, Marc opens a box and eats all the apples in it. However, if he eats strictly more than $2n+1$ apples in two consecutive days, he gets stomach ache. Prove that Marc has exactly $2^n$ distinct ways of choosing the boxes so that he eats all the apples but doesn't get stomach ache.
2023 pOMA
Day 1
Let $\triangle ABC$ be an acute triangle, and let $D,E,F$ respectively be three points on sides $BC,CA,AB$ such that $AEDF$ is a cyclic quadrilateral. Let $O_B$ and $O_C$ be the circumcenters of $\triangle BDF$ and $\triangle CDE$, respectively. Finally, let $D'$ be a point on segment $BC$ such that $BD'=CD$. Prove that $\triangle BD'O_B$ and $\triangle CD'O_C$ have the same surface.
Find all positive integers $l$ for which the equation \[ a^3+b^3+ab=(lab+1)(a+b) \]has a solution over positive integers $a,b$.
Day 2
Let $x_1,x_2,\ldots,x_n$ be positive real numbers such that \[ x_1+\frac{1}{x_2} = x_2+\frac{1}{x_3} = x_3+\frac{1}{x_4} = \dots = x_{n-1}+\frac{1}{x_n} = x_n+\frac{1}{x_1}. \]Prove that $x_1=x_2=x_3=\dots=x_n$.
Let $n\ge 2$ be a positive integer, and let $P_1P_2\dots P_{2n}$ be a polygon with $2n$ sides such that no two sides are parallel. Denote $P_{2n+1}=P_1$. For some point $P$ and integer $i\in\{1,2,\ldots,2n\}$, we say that $i$ is a $P$-good index if $PP_{i}>PP_{i+1}$, and that $i$ is a $P$-bad index if $PP_{i}<PP_{i+1}$. Prove that there's a point $P$ such that the number of $P$-good indices is the same as the number of $P$-bad indices.
Let $\Omega$ be a circle, and let $A$, $B$, $C$, $D$ and $K$ be distinct points on it, in that order, and such that lines $BC$ and $AD$ are parallel. Let $A'\neq A$ be a point on line $AK$ such that $BA=BA'$. Similarly, let $C'\neq C$ be a point on line $CK$ such that $DC=DC'$. Prove that segments $AC$ and $A'C'$ have the same length.