--- In primenumbers@y..., Hans.Rosenthal@t... wrote:

> We count 351 members on this prime numbers list at the moment.

> I was wondering how many and what prime project(s) they follow

> at present.

[...]

> I'm really curious about what all the members of this list are

> hunting for *at the very moment*. The number of projects alone

> should be immense, but the kind of projects might surprise us.

>

> Hans

>

I'm working in making a Java applet to factor as fast as possible, so

it can be used by the general people on Internet. I implemented the

algorithms ECM and SIQS.

Its Web address is:

http://www.alpertron.com.ar/ECM.HTM
The source code is available in the same page.

In order to test the applet, I used it to factor a 80-digit composite

= P40 x P41 where:

P40 = (2^132 - 187)/3

P41 = 2^133 - 99

The computation took 2d 8h 57m 34s in a Celeron 566 MHz. The linear

algebra phase, using the Block Lanczos algorithm on a sparse binary

matrix of 26038 x 27379, took only 3m 30s.

There are several other people that are using the applet. See for

example the hunt for the factors of partition numbers P(n) at:

http://www.asahi-net.or.jp/~KC2H-MSM/mathland/part/whatsnew.htm
where Tom Hill is using the applet to find the factors.

Best regards,

Dario Alejandro Alpern

Buenos Aires - Argentina

http://www.alpertron.com.ar/ENGLISH.HTM