Permutation

Rare card · No. 73070

In mathematics, a permutation is a bijective function of a finite set onto itself. When the set is represented as an ordered sequence of its members, a permutation amounts to change the place of the members of the set: if f is a permutation, ⁠ f ( i ) {\displaystyle f(i)} ⁠ is the new place of the ith member of the sequence. If the set is naturally ordered (typically the first natural numbers) or if an order of the set members has been chosen, a permutation of a set S is well represented by the sequence of the images of the members of S. For example, the permutation that maps ⁠ 1 , 2 , 3 , 4 {\displaystyle 1,2,3,4} ⁠ respectively to ⁠ 1 , 3 , 2 , 4 {\displaystyle 1,3,2,4} ⁠, is well represented by the sequence ⁠ (...

Read on Wikipedia · Image This image was created by me, Booyabazooka, CC BY-SA 3.0