def CyclicGroup(n):
 a = list(range(1, n))
 a.append(0)
 gen = _af_new(a)
 G = PermutationGroup([gen])
 G._is_abelian = True
 G._is_nilpotent = True
 G._is_solvable = True
 G._degree = n
 G._is_transitive = True
 G._order = n
 return G

def CyclicGroup ( n ) : a = list ( range ( 1 , n ) ) a . append ( 0 ) gen = _af_new ( a ) G = PermutationGroup ( [ gen ] ) G . _is_abelian = True G . _is_nilpotent = True G . _is_solvable = True G . _degree = n G . _is_transitive = True G . _order = n return G
generates the cyclic group of order n as a permutation group .