N-set

From Wikipedia, the free encyclopedia

In mathematics, an n-set is a set containing exactly n elements, where n is a natural number. Thus, every finite set is an n-set for some specific natural number n. If S is any set, then a subset of S containing k elements is called a k-subset, or a k-combination. The family of all k-subsets of a given n-set has C(n,k) elements, where C(n,k) is the binomial coefficient.