Join PrimeGrid
Returning Participants
Community
Leader Boards
Results
Other
drummerslowrise

11)
Message boards :
Proth Prime Search :
Lone Proth hunter:
(Message 24488)
Posted 4478 days ago by Kevin
Alright.. I'll try that: Ah. I get the idea. The expression needs to be typed right next to the q. Thanks for the help, all. Now, to test a few numbers at a time? It says I need to make a file that has all the numbers to be tested within it. Update: Like PrimeForm, it has a bunch of settings including what tests to use, what expressions to be evaluated, etc. Also, is there a limit to the amount of changing variables that can be used in an expression once you manage to mess with the settings? Here's what I mean: In both Proth and PrimeForm, you can only select how much the variables n and k vary, or, assign them a range. Can you assign a range to more than two variables? Does a text file have to be made for this to occur? Also: Would it be recommended to use the N1 or N+1 tests using the forms of prime I am seeking? (k * 2^n + 1, and (k * p(n)#^x + 1), for improved speed? Or should I stick with PRP?
Also.. "helper.txt"?
For the multiple number file: Or, "input.txt", I made it. When I enter it as a command, it gives an error message that reads: "Cannot open file input.txt"

12)
Message boards :
Proth Prime Search :
Lone Proth hunter:
(Message 24486)
Posted 4478 days ago by Kevin
Okay: I'm going to set it up, and I'm going to try to test a sample number: I'll choose a proven prime: 2216 * 1296^263 + 1. (You did advise to use simpler expressions.). I'll attempt to use your advice during testing. By the way, the only version that seems to work is WinPFGW. If I enter a number, using the syntax q<expression>, it always gives the message: "Evaluator failed".Here's the error message:
PFGW Version 3.3.4.20100405.Win_Stable [GWNUM 25.14]
<2216*1296^263+1>  Evaluator failed
Any tips on this?

13)
Message boards :
Proth Prime Search :
Lone Proth hunter:
(Message 24474)
Posted 4478 days ago by Kevin
Attempted to test something again. Failed + Deleted out of frustration. The old programs will do.

14)
Message boards :
Proth Prime Search :
Lone Proth hunter:
(Message 24473)
Posted 4478 days ago by Kevin
I give up.. This program of yours is too confusing to set up.. I set up a text file, it gives me an error message. I try a quick test, it instantly fails. This shall face the wrath of my delete button. *deletes* For newpgen, I tried to locate 90digit primes, as a test. Does it trialdivide all the way to 10^45? O_O

15)
Message boards :
Proth Prime Search :
Lone Proth hunter:
(Message 24472)
Posted 4478 days ago by Kevin
Advice: Don't use Proth or the original PrimeForm (assuming you are referring to the precursor to OpenPFGW). Both are really, really old. PFGW and LLR are many times faster than Proth.
Problem: Confusing setup + Complex syntax.

16)
Message boards :
Proth Prime Search :
Lone Proth hunter:
(Message 24470)
Posted 4478 days ago by Kevin
I left the machine on overnight, and found a prime of 27507 digits, which now makes it my personal record, snapping the previous by a factor of two. Now, I need to finish the other search, for the misc. prime of the form (p(a)#)^c * (p(b)#)^d * (n! * x! * k) + 1.
The prime recently found: 59991 * 2^91360 + 1 (27507 digits)

17)
Message boards :
Proth Prime Search :
Lone Proth hunter:
(Message 24465)
Posted 4479 days ago by Kevin
So I managed to download Yves Gallot's program, Proth. I also downloaded PrimeForm (allows more forms of prime to be found). I'm currently searching for primes that are 11998 and 27560 digits in length. My personal record is a 13050digit prime (Generalized Fermat prime, 1534^4096 + 1). The 27560digit prime is a Proth prime. The 11998digit prime to be searched for is a misc. prime:
It's of the form: (p(a)#)^c * (p(b)#)^d * (n! * x! * k) + 1, where a = 821, b = 126, c = 4, d = 4, n = 7, x = 11. The 27560digit prime search, I have been conducting for two days: My exponent range is in between 91360 and 93200, and the range of the coefficient k is in between 10^4 and 10^5, so I'm testing about 165,600,000 candidates. By the time the search is over, I should have 2609 primes, between 27560 and 28114 digits in length, snapping my personal record by a factor of two. Any tips?

