- A beautifull evening,

i would like to present you a square sieve algorithm to sieve prime

numbers. The algorithm is more efficent than the sieve of Eratosthenes.

Enjoy it :

http://www.devalco.de/quadratisches_Siebverfahren_e.htm

Greetings from the primes

Bernhard

http://www.devalco.de - From: "bhelmes_1" <bhelmes@...>
> Subject: square Sieve algorithm / prime numbers on polynoms

This is pretty much the same as any sieve along a polynomial.

>

> A beautifull evening,

>

> i would like to present you a square sieve algorithm to sieve prime

> numbers. The algorithm is more efficent than the sieve of Eratosthenes.

>

> Enjoy it :

> http://www.devalco.de/quadratisches_Siebverfahren_e.htm

I suspect it will fail for some polynomials, as you simply can't

self-seed the prime list in the same way that you do with Eratosthenes.

For example, your algorithm will probably fail for x^2+x+7, as it has

no way of knowing that 9 isn't prime.

From your examples it also appears that you find some primes twice.

It's not "more efficient than the sieve of Eratosthenes" as it

is doing a different task than the sieve of Eratosthenes.

Phil

() ASCII ribbon campaign () Hopeless ribbon campaign

/\ against HTML mail /\ against gratuitous bloodshed

[stolen with permission from Daniel B. Cristofani]

__________________________________

Yahoo! Mail - PC Magazine Editors' Choice 2005

http://mail.yahoo.com - Moreover, the base of the algorithm is *only* a conjecture. It might pretty

well fail for large k, even if this is counterintuitive.

On 10/17/05, Phil Carmody <thefatphil@...> wrote:

>

> From: "bhelmes_1" <bhelmes@...>

> > Subject: square Sieve algorithm / prime numbers on polynoms

> >

> > A beautifull evening,

> >

> > i would like to present you a square sieve algorithm to sieve prime

> > numbers. The algorithm is more efficent than the sieve of Eratosthenes.

> >

> > Enjoy it :

> > http://www.devalco.de/quadratisches_Siebverfahren_e.htm

>

> This is pretty much the same as any sieve along a polynomial.

> I suspect it will fail for some polynomials, as you simply can't

> self-seed the prime list in the same way that you do with Eratosthenes.

> For example, your algorithm will probably fail for x^2+x+7, as it has

> no way of knowing that 9 isn't prime.

> From your examples it also appears that you find some primes twice.

>

> It's not "more efficient than the sieve of Eratosthenes" as it

> is doing a different task than the sieve of Eratosthenes.

>

> Phil

>

> () ASCII ribbon campaign () Hopeless ribbon campaign

> /\ against HTML mail /\ against gratuitous bloodshed

>

> [stolen with permission from Daniel B. Cristofani]

>

>

>

>

> __________________________________

> Yahoo! Mail - PC Magazine Editors' Choice 2005

> http://mail.yahoo.com

>

>

> Unsubscribe by an email to: primenumbers-unsubscribe@yahoogroups.com

> The Prime Pages : http://www.primepages.org/

>

>

>

>

>

> SPONSORED LINKS

> Mathematics education<http://groups.yahoo.com/gads?t=ms&k=Mathematics+education&w1=Mathematics+education&w2=Mathematics+and+computer+science&w3=Number+theory&c=3&s=84&.sig=3wJ2ks_2UoEeW9y9JMTdVg> Mathematics

> and computer science<http://groups.yahoo.com/gads?t=ms&k=Mathematics+and+computer+science&w1=Mathematics+education&w2=Mathematics+and+computer+science&w3=Number+theory&c=3&s=84&.sig=C44lakdQThC_QqqnsQMXzw> Number

> theory<http://groups.yahoo.com/gads?t=ms&k=Number+theory&w1=Mathematics+education&w2=Mathematics+and+computer+science&w3=Number+theory&c=3&s=84&.sig=NpIofY0tvzyBKGRHV6yjCA>

> ------------------------------

> YAHOO! GROUPS LINKS

>

>

> - Visit your group "primenumbers<http://groups.yahoo.com/group/primenumbers>"

> on the web.

> - To unsubscribe from this group, send an email to:

> primenumbers-unsubscribe@yahoogroups.com<primenumbers-unsubscribe@yahoogroups.com?subject=Unsubscribe>

> - Your use of Yahoo! Groups is subject to the Yahoo! Terms of

> Service <http://docs.yahoo.com/info/terms/>.

>

>

> ------------------------------

>

--

Non sunt multiplicanda entia praeter necessitatem necnon voluptatem

( Ockam's razor, hack # 1, beta 0.1 )

[Non-text portions of this message have been removed]