P+1 testing

[bayanne]

Is there a posting specifically about this type of work?
If so can someone direct me there please, thanks

[sweety439]

Originally Posted by bayanne

Is there a posting specifically about this type of work?
If so can someone direct me there please, thanks

Do you mean N+1 primality proving method or P+1 integer factorization method?

[bayanne]

Originally Posted by sweety439

Do you mean N+1 primality proving method or P+1 integer factorization method?

I do not know either of these.

In the list of work types:

P+1 Factoring

[ATH]

Here are some discussion and explanations of P+1:
https://www.mersenneforum.org/showthread.php?t=26700

and in the 30.4/30.5/30.6 thread from post #150 and onwards when the P+1 feature was released in version 30.6:
https://www.mersenneforum.org/showthread.php?t=26376

[sweety439]

Originally Posted by bayanne

I do not know either of these.

In the list of work types:

P+1 Factoring

This is indeed the P+1 integer factorization method, click the link in my post #2 to see what is this

[bayanne]

OK, but how do I run P+1 using mprime?

[Prime95]

Originally Posted by bayanne

OK, but how do I run P+1 using mprime?

Not recommended right now. I'd use ECM and version 30.9. Someday I may get around to polynomial stage 2 for P+1 factoring.

[kriesel]

Originally Posted by bayanne

OK, but how do I run P+1 using mprime?

For background and perhaps starting the learning curve before P+1 is perhaps improved someday, there is https://mersenneforum.org/showthread.php?t=26750 and bits of https://mersenneforum.org/showthread.php?t=24607. P+1 is not a part of the usual progression of a prime exponent while searching for new Mersenne primes, so is neither automatically assigned, nor manually reserved at https://www.mersenne.org/manual_assignment/. So, worktodo entries must be constructed by the user AFAIK. See also the "New features in Version 30.6 of prime95.exe" section in mprime's whatsnew.txt distributed with the program.