olymmath

RO-TST 2014 Problem 5

    Let nn be an integer greater than 11 and let SS be a finite set containing more than n+1n+1 elements.Consider the collection of all sets AA of subsets of SS satisfying the following two conditions :(a) Each member of AA contains at least nn elements of SS .(b) Each element of SS is contained in at least nn members of AA .

    Determine max⁡Amin⁡B∣B∣\max_A \min_B |B| , as BB runs through all subsets of AA whose members cover SS , and AA runs through the above collection.

    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 ro-tst/2014/p5 · Tag 2RJDCYKC25 · Edit this page on GitHub · Keys: j next, k previous