olymmath

NO-ABEL 2001 Problem 2

    Let AA be a set, and let P(A)P (A) be the powerset of all non-empty subsets of AA . (For example, A={1,2,3}A = \{1,2,3\} , then P(A)={{1},{2},{3},{1,2},{1,3},{2,3},{1,2,3}}P (A) = \{\{1\},\{2\} ,\{3\},\{1,2\}, \{1,3\},\{2,3\}, \{1,2,3\}\} .) A subset FF of P (A)(A) is called strong if the following is true: If B1B_1 and B2B_2 are elements of FF , then B1∪B2B_1 \cup B_2 is also an element of FF . Suppose that FF and GG are strong subsets of P(A)P (A) . a) Is the union F∪GF \cup G necessarily strong? b) Is the intersection F∩GF \cap G necessarily strong?

    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 no-abel/2001/p2 · Tag 56896CMHY8 · Edit this page on GitHub · Keys: j next, k previous