NO-ABEL 2001 Problem 2
Let be a set, and let be the powerset of all non-empty subsets of . (For example, , then .) A subset of P is called strong if the following is true: If and are elements of , then is also an element of . Suppose that and are strong subsets of . a) Is the union necessarily strong? b) Is the intersection 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.
Similar problems
These problems have the most words in common with this statement.