The subgroup-count conjecture for groups with few cyclic subgroups
Statement
Let be a finite group, let denote the number of cyclic subgroups of , and let denote the number of distinct prime divisors of . Write
Subgroup-count conjecture. If
then is solvable.
This conjecture proposes a solvability criterion in terms of the number of cyclic subgroups and the number of prime divisors of the group order. The surrounding results establish related sharp bounds for subgroup counts and show that the analogous threshold for all subgroups is tight, but the stated cyclic-subgroup version remains open.
Record
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.