20091117, 02:20  #89  
Jun 2003
Oxford, UK
2^{5}×3^{2}×7 Posts 
Quote:
version  Robert G has 3 at his site http://sites.google.com/site/robertgerbicz/payam, I have tried both athlon and pentium. I have not tried to compile the c. Robert also gives samples of the other two "must have" files, in.txt and progress.txt. Put all three files, .exe and 2 .txt files into the same subdirectory. Just start. It has not crashed on me once. Maybe if you are a serious prime hunter you have overclocked. If you are using this program, check here for available ranges. Right now I am working on 58,60 and 66 Riesel and will soon free up 52 when I finish one of the iterations. The following are available on Riesel: R 52 Iteration 0,1  not sure what work done by Robert G R 52 Iteration 2  reserved by me R 52 Iteration 3, from i=41868 R 52 Iteration 4 from i=41919 R 52 Iteration 5 from i=39111 R 52 Iteration 6 from i=9849 R 82 from Iteration 7, i=89094 R 100 from Iteration 23, i=27211, see notes on smith_check for this and values above R 106 from Iteration 31, i=75969 R 130 from Iteration 65, i=31537 > R 130 unchecked, except R 268 done to Iteration 7, i=444 We will need checkers to take the stars forward from n>10000, see request about automation of this routine Last fiddled with by robert44444uk on 20091117 at 02:22 

20091117, 07:52  #90  
Jun 2003
Oxford, UK
2^{5}·3^{2}·7 Posts 
Quote:
Say you have a candidate 12345*E(52) For taking beyond n=10,000, run newpgen. Select Type as k.b^n+1 with k fixed, or 1 equivalent. Type in 2 for the base. For n type in 12345*3*5*11*13*19*29*37*53 (or similar according to the Evalue), type in kmin 10001, kmax 20000, choose an appropriate output file name, say 12345svdfrom10to20K.txt. Hit start, continue this file until p's up to about 400 million have been checked as factors. Then stop. Start pfgw. Command line: pfgw 12345svdfrom10to20K.txt l12345res10to20K.txt Send the results file, or post results on this page. Do the next value. Automation of this process is essential if we are to get through 1000 new VPS. 

20091117, 08:55  #91 
Jun 2003
Oxford, UK
2^{5}·3^{2}·7 Posts 
Some basic frequency analysis for Riesel E66:
VPS finds per iteration: Iteration 1 = 42, Iteration 2 = 39 Payam E66 per iteration: Approx 84,682,000 Frequency of VPS: approx 1 in 2,100,000 E66 Payam Numbers Finds will slowly decrease for higher iteration count, but there are clearly a lot to be found, the question is, how many. Gross Estimations of VPS: Assume that 10^36 is the largest k that will be VPS  largest found to date is approx 3*10^36 and that E<52 VPS and E>66 are rare. Clearly there are many at all levels, but these will be discounted. There are 10^36/(2*1.89*10^19) E66's in there = 2.6*10^16 Payam E66 values, spread over 312,000,000 iterations (84.7 million E66 per iteration). If the average frequency is 50% of the 1 in 2.1 million found for small iterations, then we should see 6*10^9 VPS. There will be many more E61, possibly as many as 40 times this number. Similarly there should be at least 700 times this number of E58, and 20,000 times this number of E52. Add on those at E36and smaller, and E82 and plus, and there is a surmise that there could be 10^14 VPS in the first 10^36 k, or 1 in every 10^22 k. And that is just Riesel. So multiply that by 2. That's a lot.... but they are rare. What is the maximum number of primes likely up to k=10^36 If there are 1 in 2000 of VPS that are 115+/10000, that means that there are probably 10^11 that are 115+/10000, 5*10^7 that are 130/10000, 2.5*10^4 that are 145/10000 and a handful that are 160/10000. Comments welcome, but we have only scratched at the surface!! 
20091117, 09:59  #92 
Feb 2003
5·383 Posts 
Here are another 159 Proth VPS for E=52, 58, 66, 82, 100, and 106.
One of them (S 4873844836541 66) is already known as S 58721022127 82. Currently I'm working on all E<=138 (on the Proth side). But feel free to ask for any of them, as there are many iterations left... 
20091117, 12:19  #93 
Jun 2003
Oxford, UK
3740_{8} Posts 
A real bumper crop. We already have 865 new, of which 132 are 105/10000 or better and 12 that are 110/10000 or better. Should get to the 1000 mark by weekend.
There is quite a mismatch between best to 100 primes. Thomas11 has already found 5 Sierpinskis at better than the Riesel record, in addition to the old finds. 
20091117, 18:01  #94 
Jan 2009
Ireland
2·3·31 Posts 
i cant get the program to run,but not to worry,il start testing one of the riesel k's from 10k onwards,let me know which ones have been taken past 10k and/or are reserved by someone so i can take another free one.

20091117, 21:24  #95 
Jan 2009
Ireland
2×3×31 Posts 
im taking this up to 20k,i dont think anyone has done any work on it.
R 10941694057 E66 
20091117, 21:54  #96 
Jan 2009
Ireland
2·3·31 Posts 

20091118, 01:18  #97  
Jun 2003
Oxford, UK
2^{5}·3^{2}·7 Posts 
Quote:
R 10941694057 E66 102/10000 115/20000 10729 10819 ... To be honest, the absolute values of n at these low levels is not critical. The 115/20000 information is. We think we will not have the resources to check those with less than 105/10000 and you should therefore concentrate on those posted by Thomas11. Last fiddled with by robert44444uk on 20091118 at 01:24 

20091118, 01:23  #98  
Jun 2003
Oxford, UK
3740_{8} Posts 
Quote:
I open up a console by StartProgramsAccessoriesCommand Prompt, then type in the drive letter and a colon, hit enter, type in the subdirectory you have the three files in, hot enter, and then type in payampentium or payamathlon. Worth a try 

20091118, 09:27  #99 
Feb 2003
1915_{10} Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Semiprime and nalmost prime candidate for the k's with algebra for the Sierpinski/Riesel problem  sweety439  sweety439  11  20200923 01:42 
Dual Sierpinski/Riesel prime  sweety439  Conjectures 'R Us  0  20161207 15:01 
Sierpinski/ Riesel bases 6 to 18  robert44444uk  Conjectures 'R Us  139  20071217 05:17 
Sierpinski/Riesel Base 10  rogue  Conjectures 'R Us  11  20071217 05:08 
Sierpinski / Riesel  Base 22  michaf  Conjectures 'R Us  49  20071217 05:03 