20190627, 16:20  #34  
Sep 2003
A13_{16} Posts 
Quote:
You would normally get the PRP line the same way, but it won't give it out since there's an old dead LL test still assigned. Code:
PRP=N/A,1,2,665972737,1,87,0 

20190627, 18:23  #35  
Sep 2002
Database er0rr
2^{3}×3×139 Posts 
Quote:
Quote:
Code:
[Work thread Jun 27 19:30] Iteration: 10000 / 665972737 [0.00%], ms/iter: 82.912, ETA: 639d 01:55 Last fiddled with by paulunderwood on 20190627 at 18:32 

20190627, 19:26  #36  
Sep 2003
2,579 Posts 
Quote:
I have started the P−1 test. However Primenet doesn't register an assignment. It might take 10 days or so. 

20190627, 19:29  #37  
Sep 2002
Database er0rr
6410_{8} Posts 
Quote:


20190627, 20:35  #38  
"Robert Gerbicz"
Oct 2005
Hungary
2·13·53 Posts 
Quote:
1. if s=2, then it remains s=2 after x>x^22, and we're seeking 0 for LLT, but that would be still crackpot, because q doesn't divide Mq, the modulus used in LLT. 2. yes we see that 607 is in the sequence by a totally wrong method, you got a strong law of small number hit. 3. you can check that S[n]2=(S[n1]2)*S[n2]^2 (this is also the heart of the Jacobi check in the LLT), so the new factors come from S[n2]. It is provable (if I'm not wrong), that the odd prime factors of S[m] has got p=k*2^(m+2)+1 form. 

20190627, 20:52  #39 
Sep 2002
Database er0rr
3336_{10} Posts 
I have been agonizing over this for days. Yes it seems the law of small numbers holds  except if you check Mod(Mod(1,p)*x,x^24*x+1)^(lift(Mod(2,p^21)^p)%p)== x or x+4 for all primes below some largish bound they are not as dense as they are in the sequence given in the OP.

20190627, 23:06  #40  
Sep 2002
Database er0rr
2^{3}·3·139 Posts 
Quote:
if kronecker(3,p)==1 check Mod(Mod(1,p)*x,x^24*x+1)^(lift(Mod(2,p^21)^p1)%p) == 1 if kronecker(3,p)==1 check Mod(Mod(1,p)*x,x^24*x+1)^(lift(Mod(2,p^21)^p+1)%p) == 1 Or combining the two: Mod(Mod(1,p)*x,x^24*x+1)^(lift(Mod(2,p^21)^pkronecker(3,p))%p) == 1 

20190630, 09:20  #41  
Oct 2007
London, UK
1300_{10} Posts 
Quote:
Edit: In fact, with such a payoff, one only needs to be 0.5% sure it is prime for it to be a good bet... Last fiddled with by lavalamp on 20190630 at 09:36 

20190630, 10:31  #42  
Sep 2002
Database er0rr
2^{3}×3×139 Posts 
Quote:
Last fiddled with by paulunderwood on 20190630 at 10:36 

20190630, 17:29  #43  
Sep 2002
Database er0rr
2^{3}×3×139 Posts 
Quote:
Code:
count=32;size=2^8;for(test=1,count,sample=random(size+1);if(sample%size==0,print([test]))) Last fiddled with by paulunderwood on 20190630 at 20:56 

20190630, 17:57  #44 
Oct 2007
London, UK
2^{2}×5^{2}×13 Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
The "one billion minus 999,994,000" digits prime number  a1call  Miscellaneous Math  179  20151112 14:59 
question range 1 billion to 2 billion?  Unregistered  Information & Answers  7  20100812 06:25 
Billion digit prime?  lfm  Operation Billion Digits  6  20090107 01:17 
Factoring a 617digit number?  Shakaru  Factoring  2  20050223 19:22 
10,000,000 digit number  Unregistered  Software  3  20040303 19:20 