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.

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