An algorithm, based on a conjecture, to compute a permutation whose repeated application to a given set will yield a maximum number of different orderings of that set is presented. The algorithm gives the lengths of the cycles required. This problem turns out to be equivalent to the problem of determining a partitionB(n) ofn for which the least common multiple (l.c.m.) of the numbers ofB(n) is maximal.