olymmath

ISL 2023 C4

Let n⩾2n \geqslant 2 be a positive integer. Paul has a 1×n21 \times n^{2} rectangular strip consisting of n2n^{2} unit squares, where the ith i^{\text {th }} square is labelled with ii for all 1⩽i⩽n21 \leqslant i \leqslant n^{2}. He wishes to cut the strip into several pieces, where each piece consists of a number of consecutive unit squares, and then translate (without rotating or flipping) the pieces to obtain an n×nn \times n square satisfying the following property: if the unit square in the ith i^{\text {th }} row and jth j^{\text {th }} column is labelled with aija_{i j}, then aij−(i+j−1)a_{i j}-(i+j-1) is divisible by nn. Determine the smallest number of pieces Paul needs to make in order to accomplish this.

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

Official text: IMO 2023 Shortlist booklet, page 7.

Show the answer

2n-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).

Locator isl/2023/c4 · Tag PP1HY7BE7M · Edit this page on GitHub · Keys: j next, k previous