Double Checking discussion (1<n<3M)

[smh]

I started at 1M. I've run the P-1 up to 85E7, the P+1 up to 11E7, and the ECM up to 3M.

You need to run 1100 curves with B1=1M to find most 35 digit factors
See the ECMNET page for mor information.

Edit: The following were on my list and not on yours:

Seems that i forgot to get all K=55459 numbers. I've added them to my list (found a factor for one of them already)

Could you let me know which 12 N you've eliminated?

A few more then 12 I'll attach them (not all are submitted yet (can't get to that page) but i'll do that tonight).

Yes, I would appreciate some help setting it up. First of all where can I get UBASIC for Windows?

I can't find it online at the moment, but i can send you a slightly changed version of the program (only changes are to produce an output file with the found factors) tonight (NL time).

Is it okay to send a couple of hundred Kb to your e-mail add.?