olymmath

SCHWEITZER 2018 Problem 2

    A family F\mathcal{F} of sets is called really neat if for any A,B∈FA,B\in \mathcal{F} , there is a set C∈FC\in \mathcal{F} such that A∪B=A∪C=B∪CA\cup B = A\cup C=B\cup C . Let f(n)=min⁡{max⁡A∈F∣A∣ ⁣:F is really neat and ∣∪F∣=n}.f(n)=\min \left\{ \max_{A\in \mathcal{F}} |A| \colon \mathcal{F} \text{ is really neat and } |\cup \mathcal{F}| =n\right\} . Prove that the sequence f(n)/nf(n)/n converges and find its limit.

    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 schweitzer/2018/p2 · Tag FRQQC180JP · Edit this page on GitHub · Keys: j next, k previous