Skip to content

Permutation

Defines Permutation, permutation

A permutation of a set is an arrangement of its elements in a definite order. The number of permutations of nn distinct objects is n!n! (n factorial).

Permutations can also be viewed as bijective functions from a set to itself. Under composition, the permutations of a set form a group — the symmetric group SnS_n. This is one of the most important examples of a non-abelian group (for n3n \geq 3).

A kk-permutation of nn objects is an ordered selection of kk objects from nn, numbering n!(nk)!\frac{n!}{(n-k)!}.

Relations

Date created

Cite

@misc{emsenn2026-permutation,
  author    = {emsenn},
  title     = {Permutation},
  year      = {2026},
  url       = {https://emsenn.net/library/math/domains/number-theory/terms/permutation/},
  publisher = {emsenn.net},
  license   = {CC BY-SA 4.0}
}