PFGW 3.8.3 (with gwnum v28.7) Released

[a1call]

Originally Posted by paulunderwood

GIGO. What is "it"? "***"?

It's there integer that I input, I replaced it with*** before posting here (for privacy).
The actual GUI output shows the integer.

[paulunderwood]

Originally Posted by a1call

It's there integer that I input, I replaced it with*** before posting here (for privacy).
The actual GUI output shows the integer.

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.

[a1call]

The input to the GUI is:

pfgw -t -f -q2*3^19+1

The output from the GUI is:

PFGW Version 3.8.3.64BIT.20161203.Win_Dev [GWNUM 28.6]

Primality testing 2*3^19+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3


Done.

The actual exponent is not 19 but rather a slightly larger integer.

Thank you for your time.

[paulunderwood]

Originally Posted by a1call

The input to the GUI is:

pfgw -t -f -q2*3^19+1

The output from the GUI is:

PFGW Version 3.8.3.64BIT.20161203.Win_Dev [GWNUM 28.6]

Primality testing 2*3^19+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3


Done.

The actual exponent is not 19 but rather a slightly larger integer.

Thank you for your time.

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.

[rogue]

IIRC, ou an also add -Cverbose to get the residue output to the screen.

[a1call]

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 prime-log.

PFGW Version 3.7.10.64BIT.20150809.Win_Dev [GWNUM 28.6]

Primality testing 2*3^105106+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 2
2*3^105106+1 is prime! (50.0695s+0.0029s)

Done.

With my original candidate there is no is-prime statement and the candidate is not added to the prime-log.

Am I safe to assume that
"Running N-1 test using base 3"
has determined that the candidate is not prime?
Or should I consider the result inconclusive?


Thank you in advance.

[a1call]

Ran the exact same input on a different computer with the folder copied from the 1st.
Set the "Output" to "Screen Verbose"

pfgw -t -f -q2*3^1982877+1

PFGW Version 3.7.10.64BIT.20150809.Win_Dev [GWNUM 28.6]

Primality testing 2*3^1982877+1 [N-1, Brillhart-Lehmer-Selfridge]
trial factoring to 371935266
Running N-1 test using base 3
Special modular reduction using all-complex FMA3 FFT length 192K, Pass1=128, Pass2=1536 on 2*3^1982877+1
2*3^1982877+1 is composite (13905.0449s+0.0390s)


Done.

[calimero22]

Hi
Is there the 32-bit version of PFGW?
Thank you
GIovanni

[ET_]

Originally Posted by calimero22

Hi
Is there the 32-bit version of PFGW?
Thank you
GIovanni

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

[calimero22]

Thank You Luigi.
Ciao
Giovanni

[a1call]

-t -f -q36669253978236339433616874595555104797964800838891441708308116060327868852459

PFGW Version 3.8.3.64BIT.20161203.Win_Dev [GWNUM 28.6]

Primality testing 36669253978236339433616874595555104797964800838891441708308116060327868852459 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 2
36669253978236339433616874595555104797964800838891441708308116060327868852459 is PRP! (0.0331s+0.5524s)

Done.

Isn't the -t switch supposed to be deterministic?
Else, how can I make a deterministic primality test of this prime?
Thank you for your time.