olymmath

IMC 2017 Problem 4

    There are nn people in a city, and each of them has exactly 10001000 friends (friendship is always symmetric). Prove that it is possible to select a group SS of people such that at least n2017\frac{n}{2017} persons in SS have exactly two friends in SS .

    Dataset text AI-MO AoPS. Quoted with source.

    Official text: International Mathematics Competition for University Students 2017 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 imc/2017/p4 · Tag HQQSZP64FV · Edit this page on GitHub · Keys: j next, k previous