Number of groups of a given order?

  • Thread starter Thread starter tgt
  • Start date Start date
  • Tags Tags
    Groups
tgt
Messages
519
Reaction score
2
Is there a formula for determining the number of different groups up to isomorphism for a group of a given order?
 
Physics news on Phys.org
There isn't a general formula, but the number of groups has been tabulated for a large number of values.

http://people.csse.uwa.edu.au/gordon/remote/cubcay/ has a list of the number of groups up to order 1000. An interesting error causes it to say the number of groups of order 512 is -1, but it is actually 10,494,213.

Mathematica 7 includes the function FiniteGroupCount, which will tell you the number of groups of a given order, up to 2047.
 
Last edited by a moderator:
I should add: In general, it's quite hard to find the number of groups of a given order. Can you prove that there are exactly 5 groups of order 8? 5 groups of order 12? It's not trivial.

Of course, for certain cases it's easy: Let p be a prime. Then there is exactly one group of order p (the cyclic one) and exactly two groups of order p2 (there are two abelian ones for sure, and it's a bit harder to show that every group of order p2 is abelian (hint: use the class equation)). It's harder to show that there are exactly five groups of order p3, but it's true.
 
Last edited:
This seems such a fundamental question that more emphasis should be put on it. Is it a famous open problem as groups are so widely used.
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
Back
Top