A cycle of length k is a permutation f for which there exists an element x in {1,..., n } such that x, f (x), f (x),..., f (x) = x are the only elements moved by f ; it conventionally is required that k ≥ 2 since with k = 1 the element x itself would not be moved either. The permutation h defined by