mersenneforum.org - View Single Post - Conjectured compositeness tests for N=k⋅2n±c by Predrag

T.Rex · 2015-09-06, 18:59

About proving the sufficiency, I think that an issue (as I already said) is that s can be equal to sn before i==n-1 .
Finding s(n-1)==sn only after n-1 iterations and not before is important I think.
I think that it is important to add a check s!=sn after the computation of s from i=1,n-2 .

2015-09-06, 18:59	#14
T.Rex Feb 2004 France 3²×103 Posts	About proving the sufficiency, I think that an issue (as I already said) is that s can be equal to sn before i==n-1 . Finding s(n-1)==sn only after n-1 iterations and not before is important I think. I think that it is important to add a check s!=sn after the computation of s from i=1,n-2 .