olymmath

ILL 1985 Problem 61

    Consider the set A={0,1,2,…,9}A = \{0, 1, 2, \dots , 9 \} and let (B1,B2,…,Bk)(B_1,B_2, \dots , B_k) be a collection of nonempty subsets of AA such that Bi∩BjB_i \cap B_j has at most two elements for i≠ji \neq j . What is the maximal value of k ?k \ ?

    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/1985/p61 · Tag CQM960Q7D3 · Edit this page on GitHub · Keys: j next, k previous