olymmath

KöMaL 2010 A518

    How many distinct subsets A1A_1,...,AtA_t of an nn-element set can be chosen such that (Ai∩Ak)⊆Aj(A_i\cap A_k)\subseteq A_j for all 1≤i\le i<jj<k≤tk \le t?

    Official text KöMaL. 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 hu-komal/2010/a518 · Tag PR36CHZT37 · Edit this page on GitHub · Keys: j next, k previous