ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite group, let cyc(G)\mathrm{cyc}(G) denote the number of cyclic subgroups of GG, and let π(G)\pi(G) denote the number of distinct prime divisors of ∣G∣|G|. Write

t=π(G).t=\pi(G).

Subgroup-count conjecture. If

cyc(G)<2t+2,\mathrm{cyc}(G)<2^{t+2},

then GG 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.