program P-1 for K*2^n-1
 

Hi All,

as promised here is a sample of P-1 for [URL=http://www.15k.org/k2n-1.zip]K*2^n-1[/URL]
It is manual, but I'm working to get it to work with the NewPGen file. Have a try at it and let me know what you think.
I didn't make from gmp. Just to many includes in those files.
the source is from Andi34 and I as we were both coding factoring algorythm ecm, fermat, p-1, trial, etc...

p.s. it won't stop until it's done (unless you kill it)
Joss L15.

Now we are talkin!

Trying it now
:alien:

I'm running it on 210885*2^999997-1

fyi-
It's "stuck" at Current = 6 for the last 3 hours.
I'll let it run overnight.

It's "stuck" at Current = 6 for the last 3 hours.
I'll let it run overnight.

Mark something must be wrong

try
210885 999997 10000

is should try p-1 up to prm(10000) wich is = 104729
is will test gcd every 827 p-1

I'll try 999996.
I'm at current=10 in 20 sec.

Joss.

V1.1 is out [URL=http://www.15k.org/k2n-1.zip]K.2^n-1[/URL]
It will do gcd more often.
It has nextk and nextn to quickly do the next one.

would you mind adding a short textfile to help us using it the right way? :blush:

Luigi

A Small help file has been added.
Joss

GREAT!

Thank you!

Luigi

Thank you for a nice software! I tried it and it's working. It's a bit slow but my cpu is slow too, an old 800MHz P-3 (all fast cpu's are busy searching for primes :grin: )

I opened an old sieving output file and gave him
to factor 1003166*2^1003166-1 with a known factor 2633. Instead he found 38,512,891!

By the way, in our case with trial factoring done to 4*10^12 what's your recommendation for P? And do you plan a batch version that can read the output of NewPGen and work as a "fine-sieve"? Or inclusion in the new version of LLR ...

[QUOTE] And do you plan a batch version that can read the output of NewPGen and work as a "fine-sieve"? Or inclusion in the new version of LLR ...[/QUOTE]

Yes I'm working on the batch version to do the P-1

The sieve like NewPGen uses assembly and is very fast
My C++ is not fast enough.

I'm also working on the source file of LLR to get the P-1 to work directly from LLR.EXE It would be much faster than my P-1.
We would be able to use the second stage of P-1.

Joss

Hey Joss,

Would you mind, if p-1 is used for a General Mersenne project?
:alien: :bow: