natorics </h2>

<p>The <code>combinatorics</code> package provides several functions to work with
permutations and to permute elements of a list. The permutations of
degree <em>n</em> are all the <em>n</em>! possible orderings of the first
<em>n</em> positive integers, 1, 2, &hellip;, <em>n</em>. The functions in this
packages expect a permutation to be represented by a list of those
integers.
</p>
<p>Cycles are represented as a list of two or more integers <em>i_1</em>,
<em>i_2</em>, &hellip;, <em>i_m</em>