MathDB

Define a \emph{selfish} set to be a set which has its own cardinality as its element. And a set is a \emph{minimal }\text{ selfish} set if none of its proper subsets are \emph{selfish}. Find with proof the number of

\text{minimal selfish}

subsets of

\{1,2,\cdots ,n\}

Problem Statement