Home Competitions SCHWEITZER 2018 Problem 2
SCHWEITZER 2018 Problem 2
A family F \mathcal{F} F of sets is called really neat if for any A , B ∈ F A,B\in \mathcal{F} A , B ∈ F , there is a set C ∈ F C\in \mathcal{F} C ∈ F such that A ∪ B = A ∪ C = B ∪ C A\cup B = A\cup C=B\cup C A ∪ B = A ∪ C = B ∪ 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\} . f ( n ) = min { A ∈ F max ∣ A ∣ : F is really neat and ∣ ∪ F ∣ = n } . Prove that the sequence f ( n ) / n f(n)/n f ( 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