Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: Notesfiles $Revision: 1.7.0.10 $; site uiucdcsp
Path: utzoo!watmath!clyde!cbosgd!ihnp4!inuxc!pur-ee!uiucdcsp!leimkuhl
From: leimkuhl@uiucdcsp.CS.UIUC.EDU
Newsgroups: net.math
Subject: Re: Finding groups of order N
Message-ID: <9600026@uiucdcsp>
Date: Sat, 16-Nov-85 14:21:00 EST
Article-I.D.: uiucdcsp.9600026
Posted: Sat Nov 16 14:21:00 1985
Date-Received: Mon, 18-Nov-85 06:28:32 EST
References: <1208@bbncc5.UUCP>
Lines: 5
Nf-ID: #R:bbncc5.UUCP:1208:uiucdcsp:9600026:000:144
Nf-From: uiucdcsp.CS.UIUC.EDU!leimkuhl    Nov 16 13:21:00 1985




This is a very hard question for most n.  It is easy to show, however, that
the number of nonisomorphic groups of order n is at most n^(n^2).