olymmath

IMC 2021 Problem 3

    We say that a positive real number dd is goodgood if there exists an infinite squence a1,a2,a3,...∈(0,d)a_1,a_2,a_3,...\in (0,d) such that for each nn , the points a1,a2,...,ana_1,a_2,...,a_n partition the interval [0,d][0,d] into segments of length at most 1n\frac{1}{n} each . Find sup{d∣dis good}\text{sup}\{d| d \text{is good}\} .

    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 imc/2021/p3 · Tag 58F4XRMYN7 · Edit this page on GitHub · Keys: j next, k previous