“Simple diagonal” and “twisted wreath” are types of these operations’ “finite primitive” groups described by the O’Nan–Scott theorem. Every group can be realized as a subgroup of these operations’ groups by Cayley’s theorem. These operations can be represented by matrices containing one entry (10[1])of 1 in each row and column (-5[1])and 0 everywhere else. These operations are the elements (-5[1])of a symmetric group. The parity of these (10[1])operations (-5[1])is determined by the number of inversions they contain. When these operations have no (10[1])fixed points, they are called derangements. The number of these operations on a set with n elements is n factorial. (10[1])For 10 points, name these rearrangements of a (10[1])set that consider order. ■END■ (10[4])