2017 General #8
Source:
May 8, 2018
combinatorics
Problem Statement
Marisa has a collection of distinct nonempty subsets of . For each step she takes two subsets chosen uniformly at random from the collection, and replaces them with either their union or their intersection, chosen randomly with equal probability. (The collection is allowed to contain repeated sets.) She repeats this process times until there is only one set left in the collection. What is the expected size of this set?