Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let F= set of all non-isomorphic groups of order n where n>=2. I want to show that F is a finite set.

I want to use the fact: Every group |G|=n is an isomorphic to a subgroup of Sn. But i don't know how.

Can anyone give me a direction please? Thank you

share|cite|improve this question
How many subgroups of $S_n$ are there? (Can there be infinitely many?) – Quinn Culver Dec 14 '12 at 16:18
How many distinct multiplication tables can you write down on a set of size $n$? – Alex B. Dec 14 '12 at 16:19
up vote 2 down vote accepted

Show that a group is finite iff it has a finite number of subgroups.

share|cite|improve this answer
okay so i use the fact above to show that Sn has finite # of subgroups and all non-isomorphic groups in F are isomorphic to atleast one subgroup of Sn and therefore there are finitely many non-isomorphic groups in F, therefore F is a finite set! – d13 Dec 14 '12 at 16:34
Indeed so, just as Alex and Quinn already hinted in their comments. – DonAntonio Dec 14 '12 at 16:36
thanks a lot for ur help!! – d13 Dec 14 '12 at 16:37

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.