PFGW 3.8.3 (with gwnum v28.7) Released

[pepi37]

Originally Posted by rogue

I don't understand. -q takes a number or expression as input, not a file. You would have pfgw -od -lprime.txt infile.txt or pfgw -od -lprime.txt -q"number"

Can you give me a specific example of what you are trying to do so that I can understand?

Quotes was problem!
If you put pfgw -od -lprime2.txt -q"11*2^2897409+1" then you got error, but if you write pfgw -od -lprime2.txt -q11*2^2897409+1 (without quotes around number) then everything is ok, and got decimal expansion.
Thanks for reply!

[firejuggler]

The quote are needed only when you use the command line. If you are using the GUI, you don't need the quote.

[rogue]

Originally Posted by pepi37

Quotes was problem!
If you put pfgw -od -lprime2.txt -q"11*2^2897409+1" then you got error, but if you write pfgw -od -lprime2.txt -q11*2^2897409+1 (without quotes around number) then everything is ok, and got decimal expansion.
Thanks for reply!

For the command line, quotes are sometimes needed if the expression has "^" in it as Windows treats that as an escape sequence. They are not needed when using the U/I.

[pepi37]

Thanks for explanation!

[rogue]

I've posted pfgw 3.7.5 over at sourceforge. I removed the tree factoring code as it missed factors and had other issues. I also found and fixed another Win64 bug, this one found when using -e. The Mac and Linux builds will follow later today.

[Puzzle-Peter]

I couldn't find this in the PFGW documentation neither in the forum:

For a PRP or a primality test, I get an output containing two timings

<Number> is composite: RES64: [896434D6F48089DD] (666.9374s+163.6538s)

what do those two timings mean? They're both quite substantial, so I'd like to know what they measure.

[rogue]

Originally Posted by Puzzle-Peter

I couldn't find this in the PFGW documentation neither in the forum:

For a PRP or a primality test, I get an output containing two timings

<Number> is composite: RES64: [896434D6F48089DD] (666.9374s+163.6538s)

what do those two timings mean? They're both quite substantial, so I'd like to know what they measure.

I believe that the second is the time used for trial factoring and the first is the time for the test, but I'd have to look at the code to verify.

[Puzzle-Peter]

Thanks. I'm fooling around writing a script for one of my less than sensible ideas and need to reduce the runtimes if I want to live to see a result...

[firejuggler]

hi. I found a slight problem...
When I run the newbase script on b642 and it hit the specific value of 8000*642^3+1, it enter a infinite loop

8000*642^3+1 is 3-PRP! (0.0000s+0.0017s)
Primality testing 8000*642^3+1 [N-1, Brillhart-Lehmer-Selfridge]

Running N-1 test using base 11
Running N-1 test using base 13
Running N-1 test using base 17
.....
Running N-1 test using base 4013
Running N-1 test using base 4019
....

while factordb manage to factor it into
2116874304001<13> = 31 · 73 · 97 · 751 · 12841
I have found another prime at n=11 so that's not really a problem for me. Might concern some others.

[Batalov]

8000*642^3+1 is a sum of cubes, too.

[rogue]

Originally Posted by firejuggler

hi. I found a slight problem...
When I run the newbase script on b642 and it hit the specific value of 8000*642^3+1, it enter a infinite loop

8000*642^3+1 is 3-PRP! (0.0000s+0.0017s)
Primality testing 8000*642^3+1 [N-1, Brillhart-Lehmer-Selfridge]

Running N-1 test using base 11
Running N-1 test using base 13
Running N-1 test using base 17
.....
Running N-1 test using base 4013
Running N-1 test using base 4019
....

while factordb manage to factor it into
2116874304001<13> = 31 · 73 · 97 · 751 · 12841
I have found another prime at n=11 so that's not really a problem for me. Might concern some others.

Please e-mail me the specific script you are let me know which OS you are running on.