N-set

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 X is denoted X^(k) or ; it has C(n,k) elements, where C(n,k) is the binomial coefficient.

References

• Gian-Carlo Rota (1978). Studies in Combinatorics. MAA Studies in Mathematics. 17. Mathematical Association of America. p. 3. ISBN 0-88385-117-2. 

This combinatorics-related article is a stub. You can help Wikipedia by expanding it. v • d • e