## Re: Infallible isprime(p) routine for 0<2^32

Expand Messages
• ... --this gives me a blank page. ... --this pdf file is called unrepairably damaged hence unreadable by my computer.
Message 1 of 37 , Mar 11, 2013
> > > Blowing my own trumpet: While no one knows a counterexample to the 1+2 selfridge BPSW, I have yet to find a counterexample > 10^13 to:
> > >
> > > (L+2)^(n+1)==2*x+5 (mod n, L^2-x*L+1), minimal x>=0
> > >
> > > which can be done in 2 selfridge. Coupled with a 2-sprp test it makes a 1+2 selfridge test, but with the power of 4 selfridge; it has an implicit, free base 2*x+5 prp test. This makes it stronger than BPSW!
> > >
> > > Paul
> >
> > --you've got to stop describing this stuff in mysterious language nobody but you can understand. Well, maybe somebody follows, but I at any rate, have no idea what you are saying nor why this "can be done in 2 selfridge."
> >
> > If you are right, it is worth stating it in a comprehensible manner...
> >
>
> Warren, for a definition of "a selfridge unit" please see:

--this gives me a blank page.

> To see how I got to 2 selfridge please see section 4 of my paper available at:

--this pdf file is called "unrepairably damaged" hence unreadable by my computer.
• ... Apologies, my Pari/GP script-fu is definitely not on par with DJB s. I just wanted to provide a script so that people could plug and chug an r,p pair to
Message 37 of 37 , Mar 14, 2013
On 3/13/2013 5:47 AM, Phil Carmody wrote:
> No I couldn't. That's so overly verbose and redundant it makes me twitch, I can
> barely bring myself to repeat it!
> "lift(Mod(p*s, lift(znorder(Mod(2,s))))) == 1" is just
> "p*s % znorder(Mod(2,s)) == 1"
> Having 3 exit conditions to the loop is overkill too.

Apologies, my Pari/GP script-fu is definitely not on par with DJB's. I just
wanted to provide a script so that people could plug and chug an r,p pair to see
what psp's would be generated. Also, I didn't know that the % (mod) operator
still worked in Pari. I thought everything had to be done with Mod(). Thanks
for that insight.

> The latter worries me a bit, as it might imply wasted effort. I'm trying to
> picture how these duplicates arise. Given a n, the maximal prime factor p|s is
> uniquely defined, and r as order_2(p) is uniquely defined. Therefore n can only
> appear with pair (r,p)?

And apologies here too, I mis-remembered a statement from his Category S page
and mis-spoke by applying it to the Category E psp's.

On 3/14/2013 11:02 AM, WarrenS wrote:
> 2. Consulting the Cunningham project pages,
> http://homes.cerias.purdue.edu/~ssw/cun/index.html
> every Mersenne-form number 2^r - 1 now is fully factored if
> r<929. Apparently the first two open cases are r=929 and 947
> yielding 214 and 217 digit numbers to factor.

An update here: M929 has been factored, and a group of people have already
started factoring M947. You can find the factor for M929 here:
http://homes.cerias.purdue.edu/~ssw/cun/page125
And, you can see who is factoring which Cunningham number here:
http://homes.cerias.purdue.edu/~ssw/cun/who
And more importantly, you can find all known*1 factors for all important*2
numbers in the online factor database here:
factordb.com
Once there, you can type in 2^929-1, and it will show you all the factors of
that number and that it is Fully Factored (FF). Currently, you can type in
2^947-1 and see that it is a CF, composite number, with factors known, but not
yet fully factored.

*1 = All known factors that have been stored into the factordb.
*2 = All numbers that people are interested in and store in the factordb.

Also, the factordb stores prime numbers too. Below 300 digits it will just
prove the number prime, and above that it will accept Primo certificates and
verify them locally.

-David C.
Your message has been successfully submitted and would be delivered to recipients shortly.