Subj : Re: Faster algorithm for prim numbers..!!
To   : comp.programming
From : Steve O'Hara-Smith
Date : Thu Sep 29 2005 10:40 am

On Tue, 27 Sep 2005 14:04:49 GMT
"Mabden" <mabden@sbc_global.net> wrote:

> "Steve O'Hara-Smith" <steveo@eircom.net> wrote in message
> news:20050922075541.4c108976.steveo@eircom.net...
> > On 21 Sep 2005 18:49:30 -0700
> > websnarf@gmail.com wrote:

... snip

> > > That's fine if you want that set of primes between 1 and x.  But if
> you
> >
> > Which appears to be what the OP was after.
> 
> I thought he wanted Prim numbers...

	Hmm I don't know about Prim numbers - but an efficient algorithm
for listing Proper fractions would be an interesting challenge.

-- 
C:>WIN                                      |   Directable Mirror Arrays
The computer obeys and wins.                | A better way to focus the sun
You lose and Bill collects.                 |    licences available see
                                            |    http://www.sohara.org/

.