Prefer a chat interface with context about you and your work?
Permuting the Elements of a Finite Solvable Group
Abstract The main result in this note is the following Theorem: Let G be a finite solvable group. There exists a permutation σ of the set G such that {g • σ(g); g∈G} = G if and only if the Sylow 2-subgroup of G is non-cyclic or trivial