Forgot password? New user? Sign up

Existing user? Log in

Consider the set $\mathbb{S} =\{B,R,I,L,A,N,T\}$. How many ways are there for us to partition the set into any number of non empty disjoint subsets whose Union is $\mathbb{S}$?.

Problem Loading...

Note Loading...

Set Loading...