olymmath

TW-TST 1999 Problem 6

    There are eight different symbols designed on n≥2n\geq 2 different T-shirts. Each shirt contains at least one symbol, and no two shirts contain all the same symbols. Suppose that for any kk symbols (1≤k≤7)(1\leq k\leq 7) the number of shirts containing at least one of the kk symbols is even. Determine the value of nn .

    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 tw-tst/1999/p6 · Tag P1PRTSY3MP · Edit this page on GitHub · Keys: j next, k previous