Let
The number
of partitions of
Theorem
There are
i.e. integer
Theorem
Proof
Count the set
Firstly
Define equivalence relation
by
if and only if
Thus find:
and each equivalence class has size
Let
The number
of partitions of
There are
i.e. integer
Count the set
Firstly
Define equivalence relation
by
if and only if
Thus find:
and each equivalence class has size