New k*2^n+-1 factoring project

[mklasson]

I recently put together an automated system for factoring numbers and submitting found factors to a server, along with a web site to keep track of it all -- top lists included.

The numbers we're trying to factor are k*2^n+-1 for k=3,5,7,9,11 and n<=1000, continuing and extending Sander Hoogendoorns collection of such factors.

The client uses Paul Zimmermann's gmp-ecm for the actual factoring, although you're of course welcome to use any old (or new) factoring method and submit the factors manually via a web page.

Clients are available precompiled for windows and linux, and source is provided if you should need to compile it on some other system. The clients run at IDLE priority per default.

A permanent internet connection is a big bonus as you can then have a fully automated client that downloads numbers, factors them, and submits results to the server. You can still use the system offline though, it just means more work for you.

There are a good many easy factors left to find so you should be able to get a few easy kills fairly quickly.

Anyone interested is more than welcome to participate.

Please go to http://n137.ryd.student.liu.se/factors/ for more information.

Regards,
Mikael Klasson

[ET_]

Originally Posted by mklasson

Please go to http://n137.ryd.student.liu.se/factors/ for more information.

Regards,
Mikael Klasson

Your page is really interesting, though it needs some minor rework on sorting factors page I'll take a tour on it.

Luigi

[mklasson]

Originally Posted by ET_

Your page is really interesting, though it needs some minor rework on sorting factors page

Thank you. Anything in particular?

I'll take a tour on it.

An excellent choice.

Mikael