olymmath

CAPS 2007 Problem 5

    For which n∈{3900,3901,⋯ ,3909}n\in\{3900, 3901,\cdots, 3909\} can the set {1,2,...,n}\{1, 2, . . . , n\} be partitioned into (disjoint) triples in such a way that in each triple one of the numbers equals the sum of the other two?

    Dataset text AI-MO AoPS. 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

    Similar problems

    These problems have the most words in common with this statement.

    Locator caps/2007/p5 · Tag J185BGZW6R · Edit this page on GitHub · Keys: j next, k previous