The general question is this: given a positive integer $n$, are there any non-trivial lower bounds on the number of subgroups of a group of order $n$?

Some more specific thinking: we know that in the case of cyclic groups, the number of subgroups is equal to the number of divisors of the number of elements in the group. Among all groups of the same order, does the cyclic group have the smallest number of subgroups? To put it another way, is it true that any group of order $n$ has at least $d(n)$ subgroups, where $d(n)$ is the number of divisors of $n$?

I'd appreciate any help with regard to the above questions.

  • $\begingroup$ @YCor Thanks for your advice. I think I've made the question clearer now. $\endgroup$ Sep 29 at 6:27
  • 3
    $\begingroup$ There's an answer to this on Math Stack Exchange, by Derek Holt. (The answer is yes, any group of order $n$ has at least $d(n)$ subgroups.) $\endgroup$ Sep 29 at 7:07
  • 3
    $\begingroup$ I still do not know whether there are any published proofs of this result anywhere. It would seem very surprising if there were not! $\endgroup$
    – Derek Holt
    Sep 29 at 8:17

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.