Disclaimer: This is a homework problem, but I'm just asking for clarification, not a solution.
We're asked to prove $S(0,1) = 1$, where $S(n,k)$ is "the number of different partitions of [a set of size $n$] into $k$ mutually disjoint subsets", where a partition is defined like so: "Let $X$ be a collection of pairwise disjoint sets and let $Y = \bigcup X$. Then $X$ is called a partition of $Y$ if either (i) $X = Y = \varnothing$; or (ii) $X \neq \varnothing \land \varnothing \notin X$."
As far as I can tell the only set $X$ with $\bigcup X = \varnothing$ and $|X| = 1$ is $X = \{\varnothing\}$, but this does not satisfy either (i) or (ii) of the defintion of a partition. So it seems to me that there are no size 1 partitions of $\varnothing$, and $S(0,1)$ should be $0$, not $1$.
Am I missing something here?