Permutations

## Description

A permutation is a ordered arrangement of the set of objects given.The number of permutations can be calculated by

(1)
\begin{equation} n!. \end{equation}

The Sage cell below gives back the set of all possible permutations of the numbers $1,2,3,4,5$.

## Sage Cell

#### Code

S=Permutations([1,2,3,4,5])
print("We expect ", len(S.list() ), "items below")
S.list()


## Options

#### Option

We can do the same process thing for non-numerical objects as well. In the Sage cell below, we see all the possible permutations of Kings, Queens, and Jacks.

#### Code

S=Permutations(["Kings","Queens","Jacks"])
print("We expect ", len(S.list() ), "items below")
S.list()


## Tags

Primary Tags: Combinatorics

Secondary Tags: Counting: Permutations

A list of possible tags can be found at The WeBWorK Open Problem Library. For linear algebra tags see the Curated Courses Project.

## Related Cells

Any related cells go here. Provide a link to the page containing the information about the cell.