olymmath

TSTST 2022 Problem 1

  • Answer

Let nn be a positive integer. Find the smallest positive integer kk such that for any set SS of nn points in the interior of the unit square, there exists a set of kk rectangles such that the following hold: - The sides of each rectangle are parallel to the sides of the unit square. - Each point in SS is not in the interior of any rectangle. - Each point in the interior of the unit square but not in SS is in the interior of at least one of the kk rectangles. (The interior of a polygon does not contain its boundary.)

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

2n+2

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Locator tstst/2022/p1 · Tag 2E9JRFH403 · Edit this page on GitHub · Keys: j next, k previous