Trivial for n=3.

is the number of ways to choose subsets of size 3 from a set of size n.

Fix X of cardinality n. Then, for there are two cases.

Case 1: Count number of subsets containing x. There are

Case 2: Count the number of subsets not containing x. There are

By induction,

Result follows.