Is there any theorem that states the all the finite groups of order n are the same? or some sort of theorem that refers to the order of two finite groups? If anyone can post a reference to this topic will be great... 10x in advance
|
|
No, this is unimaginably not true. In fact, there is a theorem which says that almost the opposite of what you have just said:
This is a standard set of exercises in most algebra textbooks--ask if you'd like an explicit reference. (I prove this on my blog, here) |
|||||||||
|
|
Not all groups of order n are the same. $\mathbb{Z}_6$ and $S_3$ are both of order 6. However $S_3$ has 3 subgroups of order 2, where $\mathbb{Z}_6$ has only one subgroup of order 2. Therefore they cannot be isomorphic. |
|||
|
|
|
Consider the group $C_2\times C_2$ and $C_4$. Both of order $4$ but the latter has an element of order $4$ while the former does not |
|||||
|
|
You might want to read the paper of Besche, Eick and O'Brien http://www.math.auckland.ac.nz/~obrien/research/2000.pdf which contains a table of the number of groups of order $n<2001$. |
|||
|
|