20090929, 08:49  #34 
Jun 2003
Oxford, UK
7E0_{16} Posts 
Robert
Your program seems to work quite well, it certainly did not fall down on my machine. I will have to play with the variables to see how to maximise the response, but certainly 11 VPS in a couple of days compares rather favourably to my 23 a week, which is the best I could manage recently. None of your Sierpinski VPS coincide with my table which is curious, you might have thought that at least one might have been picked up as the overall approach is not totally different and the range checked looks the same. Whjen you mention in your instructions that an iteration covers 3*10^12 K values, do you mean 3*10^12 payam numbers or 3*10^12 y values? as K is defined as y*E(x). 
20090929, 11:15  #35 
Jun 2003
Oxford, UK
2016_{10} Posts 
I used the athlon exe file on a beat up old athlon and it is eating numbers!!!!
Reserving 82 Sierpinski and Riesel 
20090929, 12:12  #36  
Jun 2003
Oxford, UK
11111100000_{2} Posts 
Quote:


20090929, 15:43  #37  
"Robert Gerbicz"
Oct 2005
Hungary
5FA_{16} Posts 
Quote:
I'm checking about 3*10^12 y values at once, as you write in your paper only a fraction of them are payam numbers, thanks to a clever sieve I quickly eliminate many of them. In fact as I've written this is not exactly 3*10^12, the correct value is 2869549272527. ps. Now I see my original post writing 3*10^12 K values, that was a typo. Last fiddled with by R. Gerbicz on 20090929 at 15:58 

20090929, 15:48  #38 
"Robert Gerbicz"
Oct 2005
Hungary
2·3^{2}·5·17 Posts 
No, these checks are independent. So it means that if both of the checks are enabled and only one of them or both of them indicates that we will not reach 100 primes then the code immediately breaks the test on that payam number.

20090929, 16:08  #39  
Jun 2003
Oxford, UK
2^{5}×3^{2}×7 Posts 
Quote:
I also reserve 66 Riesel and 100 Riesel as I experiment. I am so impressed with the performance of this software! This generates and checks payams faster by 500% than Axn1's software generated payams with no prime checking on the old machine I have. This may be due to the fact that it is also Athlon optimised. I am a happy puppy right now. The software is so fast that I am generating 74/3000 as my target rather than 100/10000 because I can check those at my leisure. 

20090929, 16:10  #40  
Jun 2003
Oxford, UK
11111100000_{2} Posts 
Quote:


20090929, 19:28  #41 
Jan 2009
Ireland
10111010_{2} Posts 
my pentium version keeps crashing.and i cant figure out what to put in the in.txt file.

20090929, 19:48  #42  
"Robert Gerbicz"
Oct 2005
Hungary
2·3^{2}·5·17 Posts 
Quote:
If you change nothing then the program should work (it will test E=52), if you want to test other E values then E+1 should be such a prime for that 2 is a primitive root modulo E+1, so for example the good E values up to 140 are: 52,58,60,66,82,100,106,130,138. (For E<52 the program not works.) If you want to start the computation from the beginning then not change iteration and I, so only modify E in progress.txt. For more information see my post above or ask. ps. I can imagine that something is bad with the exe, now I am at an Athlon computer, tomorrow I will see the exe on a Pentium, and if that is still bad then compile the code on that (I've installed gmp on that computer also.). Last fiddled with by R. Gerbicz on 20090929 at 19:50 

20090930, 01:20  #43 
Jun 2003
Oxford, UK
2^{5}×3^{2}×7 Posts 
Athlon and Pentium programs ran all night successfully on three machines and four cores. No problems. I always worry about screensavers, but this did not appear to impact performance.

20091003, 06:47  #44 
Jun 2003
Oxford, UK
2016_{10} Posts 
Also reserving Sierpinski 60.
Stupendous progress, as of now I generated 26 new values and a further 14 duplicates, in the 4 areas I reserved. No record breakers though yet. Thats 40 in 6 days, compared to the 23 a week before. I will post at a convenient time. The software has not fallen down at all. Robert G: Is there a way you could capture a racing table as well, that shows fastest performers to each prime level, each time the software is run? If this would slow things down then please do not change a thing! The softest target is the Riesel record to 100 primes which is only at n=5748. I have found 6 Sierpinskis with better records than that. 
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 