olymmath

ILL 1979 Problem 2

    For a finite set EE of cardinality n≥3n \geq 3 , let f(n)f(n) denote the maximum number of 33 -element subsets of EE , any two of them having exactly one common element. Calculate f(n)f(n) .

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