olymmath

ISL 2008 C1

In the plane we consider rectangles whose sides are parallel to the coordinate axes and have positive length. Such a rectangle will be called a box. Two boxes intersect if they have a common point in their interior or on their boundary. Find the largest nn for which there exist nn boxes B1,…,BnB_{1}, \ldots, B_{n} such that BiB_{i} and BjB_{j} intersect if and only if i≢j±1( mod n)i \not \equiv j \pm 1(\bmod n).

Dataset text NuminaMath olympiads. Quoted with source.

Official text: IMO 2008 Shortlist booklet, page 22.

Show the answer

6

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

These problems have the most words in common with this statement.

Locator isl/2008/c1 · Tag CGGY6V22WK · Edit this page on GitHub · Keys: j next, k previous