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)

    Dataset text NuminaMath olympiads. Quoted with source.

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