El módulo de enterosn only require a single generator to obtain the entire group. 1 is a nice choice of generator, as we know that every number k in {0,1,2,…n} can be written a...El módulo de enterosn only require a single generator to obtain the entire group. 1 is a nice choice of generator, as we know that every number k in {0,1,2,…n} can be written as k⋅1, which is to say, the sum of 1 with itself k times. If there are two adjacent entries that are out of order (big to the left of the small), we can apply rotations until the two things sit in the first two entries (suppose we use k rotations to do this).
