Ononot — A set of n elements is partitioned into 3 non-empty unlabele

Guest Session: 1 Question Remaining. Create Account to save progress.

Combinatoricshard

0:00.0

A set of $n$ elements is partitioned into 3 non-empty unlabeled subsets. If there are 25 ways to do this, what is $n$ ?