Given $n = \lvert G \rvert$ then the factorization of $n$ can sometimes give information about the group $G$. For example if $n$ is prime we know that the group is the cyclic group $C_n$. If $n$ is the power of a prime then we know that $G$ is nilpotent. Are there cases like these that assert that $G$ has certain properties knowing $n$? For example all groups of size $100$ are solvable, for which $n$ can one say the same?
Asked
Active
Viewed 192 times
4
-
1Have you heard about the Sylow theorems? – Arthur Feb 04 '17 at 10:25
-
What properties to they tell us about the structure of the group apart from the existence of some subgroups? – Marc Bogaerts Feb 04 '17 at 10:31
-
@Arthur In the case $n=100$ they tell us that they have a normal subgroup of order $25$; – Marc Bogaerts Feb 04 '17 at 10:37
-
Existence and number of certain subgroups is an important part of a group's structure. – Arthur Feb 04 '17 at 10:50
-
Do you mean normal subgroups or ore there other importtant cases? – Marc Bogaerts Feb 04 '17 at 10:52
-
I mean other cases too. It doesn't directly help you make a multiplication table, but it is important. – Arthur Feb 04 '17 at 11:52
1 Answers
5
We say that $n$ is a nilpotent number if when we factor $n = p_1^{a_1} \cdots p_r^{a_r}$ we have $p_i^k \not \equiv 1 \bmod{p_j}$ for all $1 \leq k \leq a_i$.
Then
- Every group of order $n$ is nilpotent iff $n$ is a nilpotent number.
- Every group of order $n$ is abelian iff $n$ is a cubefree nilpotent number.
- Every group of order $n$ is cyclic iff $n$ is a squarefree nilpotent number.
(adapted from an answer by Pete Clark)
For solvable numbers, see the last theorem in the paper Nilpotent and solvable numbers by Pakianathan and Shankar:
(also J. Pakianathan and K. Shankar, Nilpotent numbers, Amer. Math. Monthly, 107, August– September 2000, 631–634)
