olymmath

IMO 2021 Problem 1

Let n⩾100n \geqslant 100 be an integer. Ivan writes the numbers n,n+1,…,2nn, n+1, \ldots, 2 n each on different cards. He then shuffles these n+1n+1 cards, and divides them into two piles. Prove that at least one of the piles contains two cards such that the sum of their numbers is a perfect square.

Official text Transcription from AI-MO AoPS, checked word for word against the official paper. Quoted with source.

Official text: IMO 2021 official English paper, page 1.

Also ISL 2021 N2.

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 imo/2021/p1 · Tag FF3YFJNKMR · Edit this page on GitHub · Keys: j next, k previous