Problem

Source: Iranian TST Problem 1

Tags: combinatorics



Morteza Has $100$ sets. at each step Mahdi can choose two distinct sets of them and Morteza tells him the intersection and union of those two sets. Find the least steps that Mahdi can find all of the sets. Proposed by Morteza Saghafian