Small n factoring

[vjs]

Keroberts,

I'm not sure if P-1 B1=10^16 is possible for a B1 bound. I know some time back I used ecm5.0 for P-1 with a very high (I think maximum) B1 value it took quite a few days.

I think your using a athlonxp with 256MB if I remember?

You might want to try ecm6.0 P-1 (-pm1 flag) with an extremely large P-1 the program will prompt you that the max B1 value was exceeded, note the value.

Then take that value and divide it by 1000 and run stage one with it. It will complete in a reasonable time. Muliply this time by 1000 and see if your willing to dedicate that much time without a reboot.

Also make sure to save the file.

edit....

O.K. I checked the max B1 with ecm6.0 for k7 processors
This would be your command line if you first save the number as 991.txt and save the stage 1 as stage1.sav.

k7 -pm1 -save stage1.sav 9007199254740996 9007199254740996 <991.txt

Also P-1 is not 100%, the factor has to be smooth. By running this you would really only prove that no factor <16-digits exist for this number.