View Single Post
Old 2021-04-25, 18:20   #5
axn
 
axn's Avatar
 
Jun 2003

5,081 Posts
Default

Quote:
Originally Posted by ATH View Post
How does this work when the test is designed for P+1 to be smooth?
That's just the way the math works out.
A simple intro: https://en.wikipedia.org/wiki/Willia...2B_1_algorithm

The thing that needs to be smooth is p-(D|p). If (D|p) is -1, then p+1. If (D|p) is 1, then p-1.

Note:- using P+1 to find P-1 factors is inefficient because a) P+1 is slower, and b) you only have a 50% chance of success, where as pure P-1 has 100% chance of success. Therefore, if you've already run P-1, then P+1 with same bounds is not going to find any additional "p-1" factors.
axn is online now   Reply With Quote