olymmath

DE-BUNDESWETTBEWERB 2016 Problem 5

    There are n(n+1)2\tfrac{n(n+1)}{2} distinct sums of two distinct numbers, if there are nn numbers. For which n (n≥3)n \ (n \geq 3) do there exist nn distinct integers, such that those sums are n(n−1)2\tfrac{n(n-1)}{2} consecutive numbers?

    Dataset text AI-MO AoPS. Quoted with source.

    Official text: Bundeswettbewerb Mathematik 2016 official paper, page 1.

    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 de-bundeswettbewerb/2016/p5 · Tag H0ZPB4EQHR · Edit this page on GitHub · Keys: j next, k previous