Olympiad problems

2017 Baltic Way, 9

A positive integer $n$ is [i]Danish[/i] if a regular hexagon can be partitioned into $n$ congruent polygons. Prove that there are infinitely many positive integers $n$ such that both $n$ and $2^n+n$ are Danish.

2009 Regional Olympiad of Mexico Center Zone, 3

Tags: combinatorial geometry , combinatorics

An equilateral triangle $ABC$ has sides of length $n$, a positive integer. Divide the triangle into equilateral triangles of length $ 1$, drawing parallel lines (at distance $ 1$) to all sides of the triangle. A path is a continuous path, starting at the triangle with vertex $A$ and always crossing from one small triangle to another on the side that both triangles share, in such a way that it never passes through a small triangle twice. Find the maximum number of triangles that can be visited.

1992 All Soviet Union Mathematical Olympiad, 578

Tags: combinatorics , tiling , equilateral , combinatorial geometry

An equilateral triangle side $10$ is divided into $100$ equilateral triangles of side $1$ by lines parallel to its sides. There are m equilateral tiles of $4$ unit triangles and $25 - m$ straight tiles of $4$ unit triangles (as shown below). For which values of $m$ can they be used to tile the original triangle. [The straight tiles may be turned over.]

2023 Chile National Olympiad, 2

Tags: analytic geometry , combinatorics , combinatorial geometry , lattice points

In Cartesian space, let $\Omega = \{(a, b, c) : a, b, c$ are integers between $1$ and $30\}$. A point of $\Omega$ is said to be [i]visible [/i] from the origin if the segment that joins said point with the origin does not contain any other elements of $\Omega$. Find the number of points of $\Omega$ that are [i]visible [/i] from the origin.