olymmath

BxMO 2020 Problem 2

  • Answer

Let NN be a positive integer. A collection of 4N24 N^{2} unit tiles with two segments drawn on them as shown is assembled into a 2N×2N2 N \times 2 N board. Tiles can be rotated.

The segments on the tiles define paths on the board. Determine the least possible number and the largest possible number of such paths.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

4 N \leqslant p \leqslant N^{2}+(N+1)^{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 benelux/2020/p2 · Tag E95H4WNBH3 · Edit this page on GitHub · Keys: j next, k previous