Problem

Source: Moldova TST Problem 8

Tags: combinatorics, counting, Subsets



Consider a positive integer $n$ and $A = \{ 1,2,...,n \}$. Call a subset $X \subseteq A$ perfect if $|X| \in X$. Call a perfect subset $X$ minimal if it doesn't contain another perfect subset. Find the number of minimal subsets of $A$.