olymmath

DE-BUNDESWETTBEWERB 2014 Problem 2

    The 100100 vertices of a prism, whose base is a 5050 -gon, are labeled with numbers 1,2,3,…,1001, 2, 3, \ldots, 100 in any order. Prove that there are two vertices, which are connected by an edge of the prism, with labels differing by not more than 4848 .

    Note: In all the triangles the three vertices do not lie on a straight line.

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