olymmath

ISL 2011 A5

Prove that for every positive integer nn, the set {2,3,4,…,3n+1}\{2,3,4, \ldots, 3 n+1\} can be partitioned into nn triples in such a way that the numbers from each triple are the lengths of the sides of some obtuse triangle.

Dataset text NuminaMath olympiads. Quoted with source.

Official text: IMO 2011 Shortlist booklet, page 5.

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/2011/a5 · Tag WC3RH72R2K · Edit this page on GitHub · Keys: j next, k previous