olymmath

ISL 2012 C2

Let n≥1n \geq 1 be an integer. What is the maximum number of disjoint pairs of elements of the set {1,2,…,n}\{1,2, \ldots, n\} such that the sums of the different pairs are different integers not exceeding nn ?

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

Official text: IMO 2012 Shortlist booklet, page 5.

Show the answer

\left\lfloor\frac{2 n-1}{5}\right\rfloor

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/2012/c2 · Tag 1V8SFVQ9XE · Edit this page on GitHub · Keys: j next, k previous