20180824, 18:11  #310 
Sep 2002
Database er0rr
17×193 Posts 
With up to something like 10^10000000 for us to try to find your weird output, I don't think you are being very helpful in tracking down your problem, which maybe due to a bad expression or a bad switch.
Last fiddled with by paulunderwood on 20180824 at 18:34 Reason: changed specifier to switch 
20180824, 20:50  #311 
"Rashid Naimi"
Oct 2015
Out of my Body
17×107 Posts 
The input to the GUI is:
Code:
pfgw t f q2*3^19+1 The output from the GUI is: Code:
PFGW Version 3.8.3.64BIT.20161203.Win_Dev [GWNUM 28.6] Primality testing 2*3^19+1 [N1, BrillhartLehmerSelfridge] Running N1 test using base 3 Done. The actual exponent is not 19 but rather a slightly larger integer. Thank you for your time. 
20180824, 21:01  #312  
Sep 2002
Database er0rr
17·193 Posts 
Quote:
Dropping the "t" switch will run a much faster PRP check. Try putting the expession after q in quotes i.e. q"2*3^39+1". Oh and with the GUI, you don't need to have pfgw in the input line. Last fiddled with by paulunderwood on 20180824 at 21:13 

20180824, 21:32  #313 
"Mark"
Apr 2003
Between here and the
16A9_{16} Posts 
IIRC, ou an also add Cverbose to get the residue output to the screen.

20180825, 01:01  #314 
"Rashid Naimi"
Oct 2015
Out of my Body
17×107 Posts 
Thank you for the replies.
When i try some known primes of the same format with the same input format the program states that it is prime and adds it to the primelog. Code:
PFGW Version 3.7.10.64BIT.20150809.Win_Dev [GWNUM 28.6] Primality testing 2*3^105106+1 [N1, BrillhartLehmerSelfridge] Running N1 test using base 2 2*3^105106+1 is prime! (50.0695s+0.0029s) Done. Am I safe to assume that "Running N1 test using base 3" has determined that the candidate is not prime? Or should I consider the result inconclusive? Thank you in advance. 
20180825, 06:15  #315 
"Rashid Naimi"
Oct 2015
Out of my Body
17×107 Posts 
Ran the exact same input on a different computer with the folder copied from the 1st.
Set the "Output" to "Screen Verbose" Code:
pfgw t f q2*3^1982877+1 Code:
PFGW Version 3.7.10.64BIT.20150809.Win_Dev [GWNUM 28.6] Primality testing 2*3^1982877+1 [N1, BrillhartLehmerSelfridge] trial factoring to 371935266 Running N1 test using base 3 Special modular reduction using allcomplex FMA3 FFT length 192K, Pass1=128, Pass2=1536 on 2*3^1982877+1 2*3^1982877+1 is composite (13905.0449s+0.0390s) Done. 
20180914, 05:26  #316 
Nov 2015
2·3^{2} Posts 
Hi
Is there the 32bit version of PFGW? Thank you GIovanni 
20180914, 11:58  #317 
Banned
"Luigi"
Aug 2002
Team Italia
3·5·317 Posts 
Yes, I have version PFGW 3.7.7 for MAC, Windows and Linux.
http://www.fermatsearch.org/prog/pfg...7_20130722.zip http://www.fermatsearch.org/prog/pfg...7_20130722.zip http://www.fermatsearch.org/prog/pfg...7_20130722.zip Please consider donating part of your CPU time to our Team_Italia Luigi 
20180914, 12:02  #318 
Nov 2015
2×3^{2} Posts 
Thank You Luigi.
Ciao Giovanni 
20180915, 16:16  #319 
"Rashid Naimi"
Oct 2015
Out of my Body
17·107 Posts 
Code:
t f q36669253978236339433616874595555104797964800838891441708308116060327868852459 Code:
PFGW Version 3.8.3.64BIT.20161203.Win_Dev [GWNUM 28.6] Primality testing 36669253978236339433616874595555104797964800838891441708308116060327868852459 [N1, BrillhartLehmerSelfridge] Running N1 test using base 2 36669253978236339433616874595555104797964800838891441708308116060327868852459 is PRP! (0.0331s+0.5524s) Done. Else, how can I make a deterministic primality test of this prime? Thank you for your time. Last fiddled with by a1call on 20180915 at 16:29 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
A possible bug in LLR/PFGW while using GWNUM (no bug in P95)  Batalov  Software  77  20150414 09:01 
PFGW 3.2.0 has been Released  rogue  Software  94  20100914 21:39 
PFGW 3.2.3 has been Released  rogue  Software  10  20091028 07:07 
PFGW 3.2.2 has been Released  rogue  Software  20  20090823 12:14 
PFGW 3.2.1 has been released  rogue  Software  5  20090810 01:43 