home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!mcsun!sunic!dkuug!uts!euromath.dk!reus
- From: reus@klein.euromath.dk (Jens Peter Reus Christensen)
- Newsgroups: sci.math
- Subject: Re: nth prime
- Message-ID: <REUS.92Sep11110518@klein.euromath.dk>
- Date: 11 Sep 92 10:05:18 GMT
- References: <1992Sep10.190905.10741@waikato.ac.nz>
- Sender: news@euromath.dk (USENET News System)
- Organization: University of Copenhagen, Dept. of Math.
- Lines: 31
- In-Reply-To: bill@waikato.ac.nz's message of 10 Sep 92 07:09:05 GMT
-
- In article <1992Sep10.190905.10741@waikato.ac.nz> bill@waikato.ac.nz writes:
-
-
- Sorry to ask such a FAQ, but what's the quickest algorithm to
- find the nth prime? Is it O(nlogn) or something else?
-
- Bill Teahan,
- Systems Programmer,
- University of Waikato,
- Hamilton, New Zealand
- ***
- The nth prime divided by n*log(n) converges to 1 !! There is no
- simple closed formula for the nth prime known but likely an ocean
- of algoritms.
-
- --
- |--------------------------------------------------------------------------|
- | Jens Peter Reus Christensen | |
- | Associate professor, Dr. Phil.| |
- | Department of mathematics | e-mail: reus@math.ku.dk |
- | University of Copenhagen | |
- | Universitetsparken 5 | phone: +45 3135 3133 ext. 458 |
- | DK-2100 Copenhagen | fax: +45 3135 4254 |
- |--------------------------------------------------------------------------|
- | Disclaimer: Except when explicitly stated otherwise any message |
- | with this signature is the authors purely private responsibility. |
- |--------------------------------------------------------------------------|
- | Motto : For everyone who has will be given more, and he will have |
- | an abundance. Whoever does not have, even what he has will be taken |
- | from him. Matthew principle - Matth.Ch.25 v.29 |
- |--------------------------------------------------------------------------|
-