Problem

Source: ELMO Shortlist 2024/C8

Tags: Elmo, combinatorics



Let $n\ge5$ be an integer. A trapezoid with base lengths of $1$ and $r$ is tiled by $n$ (not necessarily congruent) equilateral triangles. In terms of $n$, find the maximum possible value of $r$. Linus Tang