olymmath

ISL 2022 C8

Alice fills the fields of an n×nn \times n board with numbers from 1 to n2n^{2}, each number being used exactly once. She then counts the total number of good paths on the board. A good path is a sequence of fields of arbitrary length (including 1) such that: (i) The first field in the sequence is one that is only adjacent to fields with larger numbers, (ii) Each subsequent field in the sequence is adjacent to the previous field, (iii) The numbers written on the fields in the sequence are in increasing order. Two fields are considered adjacent if they share a common side. Find the smallest possible number of good paths Alice can obtain, as a function of nn. (Serbia)

Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.

Official text: IMO 2022 Shortlist booklet, page 7.

Show the answer

2 n^{2}-2 n+1

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/2022/c8 · Tag D8G9JG47K9 · Edit this page on GitHub · Keys: j next, k previous