20200513, 17:26  #1 
Nov 2016
2153_{10} Posts 
How to use LLR?
Can someone help me? I want to use LLR to find the smallest (probable) prime of the form (185^n1)/184 (base 185 repunit, I already know that this is composite for all n<=60000, and this can be prime only for prime n), thus I download the program cllr.exe, and I type this in the sieve file:
Code:
ABC (185^$a1)/184 a: primes from 60000 to 100000 Code:
Invalid ABC format, next data lines will be flushed... 
20200513, 17:38  #2  
Sep 2002
Database er0rr
3·11·101 Posts 
Quote:
From pfgwdoc.txt: Quote:
Last fiddled with by paulunderwood on 20200513 at 17:47 

20200513, 17:49  #3 
Nov 2016
2,153 Posts 
So if I want to use LLR to test all numbers of the form (b^n1)/(b1) with b=185, 269, 281 and 60000<=n<=100000 with prime n, what should I type?

20200513, 17:51  #4  
Sep 2002
Database er0rr
3·11·101 Posts 
Quote:
Why bother? PFGW is much better at this sort of thing. More from the documentation: Quote:
Last fiddled with by paulunderwood on 20200513 at 18:10 

20200522, 20:54  #5  
"Kebbaj Reda"
May 2018
Casablanca, Morocco
5×11 Posts 
Quote:
The great advantage of pfgw over LLR is that pfgw test any form while LLR is limited to some form. But multithreading on LLR is faster than on the new version of pfgw64 with the T switch. I don't know if I don't know how to use the T switch on pfgw. 

20200522, 21:09  #6  
Sep 2002
Database er0rr
3·11·101 Posts 
Quote:
Code:
./llr64 q"(10^490811)/9" t4 Invalid expression in command line. Code:
./pfgw64 q"Phi(49081,10)" T4 PFGW Version 4.0.1.64BIT.20191203.x86_Dev [GWNUM 29.8] Phi(49081,10) is 3PRP! (7.5663s+0.0012s) Last fiddled with by paulunderwood on 20200522 at 22:19 
