olymmath

ISL 2020 N2

For each prime pp, there is a kingdom of pp-Landia consisting of pp islands numbered 1,2,…,p1,2, \ldots, p. Two distinct islands numbered nn and mm are connected by a bridge if and only if pp divides (n2−m+1)(m2−n+1)\left(n^{2}-m+1\right)\left(m^{2}-n+1\right). The bridges may pass over each other, but cannot cross. Prove that for infinitely many pp there are two islands in pp-Landia not connected by a chain of bridges. (Denmark)

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

Official text: IMO 2020 Shortlist booklet, page 12.

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/2020/n2 · Tag DP183V68N6 · Edit this page on GitHub · Keys: j next, k previous