Kourovka Notebook Problem 21.27
Statement
A permutation on a set is called a derangement if it has no fixed points in . Let G be a finite simple transitive permutation group. Is it true that every element in G is the product of two derangements?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.