20080527, 16:59  #78  
Jan 2005
1DF_{16} Posts 
Quote:
So, sit back and take a deep breath... 

20080527, 19:10  #79 
Jan 2006
Hungary
2^{2}×67 Posts 
next time I program
my program isn't finished yet. I am planning to include a base range as well. But first I want it quicker....
Willem. 
20080528, 05:37  #80  
May 2007
Kansas; USA
5×13×157 Posts 
Quote:
AHHHHHHHHHHHHHHHH!!!!!!! I can feel the fresh ocean breeze as I sit back and take in its relaxing aroma amid the lack of new bases started. 

20080528, 08:40  #81  
Jun 2003
Oxford, UK
2·3·313 Posts 
Quote:
Factor b^11 and the prime factors provide values that are not useful for covering sets. Factor b^121 and find five new prime factors  because each of b^21, b^31, b^41 and b^61 introduces one new prime factor, (with b<>2^i1 where i is an integer), and these factors provide at maximum 12cover. Looking at b=2^i1, i integer, therefore, is the remaining interesting area for covering sets, as b^21 does not provide extra prime factors. I think the smallest covering sets for the first few values of i are as follows: i b=2^i1 smallest cover 3 7 24 4 15 24? 5 31 12 6 63 12 7 127 6 8 255 6 9 511 24 10 1023 3 11 2047 6 12 4095 6 13 8191 12 14 16383 3 15 32767 12 16 65535 12 17 131071 3 18 262143 6 19 524287 6 20 1048575 4 21 2097151 6 22 4194303 3 23 8388607 4 24 16777215 6 I wonder if b=511 is the largest base with cover greater than 12? For non b=2^i1, as b gets larger it is really hard to find values where the smallest cover set is 12, as b^31, b^41, b^61 must only produce 1 new prime at each step up. An example is b=47110, with new primes introduced at n new prime factor 1 3,41,383 2 47111 3 739799737 4 2219352101 6 2219304991 Last fiddled with by robert44444uk on 20080528 at 09:13 

20080528, 16:08  #82  
Oct 2006
7·37 Posts 
Quote:
the command you use is not working i use this: Code:
covering [ENTER] exponent [ENTER] base [ENTER] riesle/sierp [ENTER] prime range [ENTER] best vaue found [ENTER] it's a lot of manual work, but i had time to try up to 431 (432 running at the moment) no better results at the moment ! 

20080528, 16:56  #83 
Jan 2005
479 Posts 
For me worked:
covering (enter) 4 8 1 100 100000000 (enter) program works... program ends... arrow up (enter) (this gives again covering arrow up (this gives the same input, you only need to change the exponent) 
20080528, 22:23  #84  
May 2007
Kansas; USA
10011111011101_{2} Posts 
Quote:
Is there a way to turn this into a batch process? I tried this in a file I called batch.bat: covering 4 8 1 10000 1000000 covering 6 8 1 10000 1000000 . . . (etc.) I then typed 'batch' at the command line and it executed the 'covering' program but it then waits for input from me. That is it won't get the input from the 2nd line. Is there a way to tell it to accept the input from the 2nd line? I also tried "covering 4 8 1 10000 1000000" all on each line of the batch file, the same as what Robert used at the command line for a nonbatch process, and had the same problem that he did. It just ignores the rest of the line after the 'covering' command. On another note, here are a couple of enhancements that I might suggest (if not already suggested): Allow a range of exponents to be entered and write the output to a file. Perhaps by a 6th input such as in: 4 144 8 1 10000 1000000 So the above would test exponents 4 thru 144 and write the output to some .txt file. Thanks for a great program! Gary Last fiddled with by gd_barnes on 20080528 at 22:26 

20080528, 22:45  #85  
A Sunny Moo
Aug 2007
USA (GMT5)
1100001101001_{2} Posts 
Quote:
echo 4 8 1 10000 1000000  covering echo 6 8 1 10000 1000000  covering ...and etc. for the rest of the commands in the batch file. 

20080529, 00:18  #86 
"Mark"
Apr 2003
Between here and the
1011100011100_{2} Posts 
Change the first few lines of the main() function to this:
Code:
int main(int argc, char *argv[]) { int N,b,C,v[32],w[32],A[32],L,LC,limit,temp,i,j,p,add,len; int pos,test,res,ord,all,p2,possible,e,*S,*R,**RES,**RES2,stored_LC[32]; long long int best; long long int alpha,alpha2,beta,M,K,E; char word[32]; if (argc == 6) { N = atol(argv[1]); b = atol(argv[2]); C = atol(argv[3]); limit = atol(argv[4]); strcpy(word, argv[5]); } else scanf("%d%d%d%d%s",&N,&b,&C,&limit,word); I suspect that using the FPU for the numerous mods in the code could double performance. 
20080529, 13:16  #87  
Jun 2003
Oxford, UK
756_{16} Posts 
Quote:
Astonishing software!!!!! Last fiddled with by robert44444uk on 20080529 at 13:39 

20080530, 14:28  #88 
Quasi Admin Thing
May 2005
13×71 Posts 
@ Everyone: Really great work you all do here. I can tell you, that if really wanna work on a huge base please consider run kranges above 500M k for base 3 riesel. If you use Michafs program, it will bring you fast in progress. However for the next month or so, no k above 500,000,000 for riesel base 3 will be worked at. So if you take any of the work above that krange please just drop a note here, and I'll catch it before starting the next ranges.
On a sidenote, it takes ~315 MB of RAM to sieve 50,000 k's from n=1 to n=25,000 using srsieve.exe, but besides from that it causes no problems to run that many candidates and test them using srsieve.exe! Also on another note, due to memory issues, it is not recommended to use sr2sieve.exe since it requires about 700MB of RAM for every 1,500 k's. Whatever you decide any one of you, it really means a lot, of course if anyone brings the conjecture below k 500,000,000... well then please consider use your ressources somewhere else Have a nice weekend, all of you, and Gary your very welcome, the least I could do was to send you the sieved files that I had, since no one really has to do more sieve when it was in fact at optimal depth at least for base 12 sierpinski. Good luck on finding a prime or at least take this big and huge leap in the Base 12 sierp testing, just hope you can do it without you or your computer gets hurt Regards KEP 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Riesel/Sierp base 2 evenk/evenn/oddn testing  gd_barnes  Conjectures 'R Us  422  20200805 05:56 
Prime finding rate, Sierp vs. Riesel?  CGKIII  Conjectures 'R Us  27  20120912 23:16 
Riesel and Sierp numbers bases <= 1024  R. Gerbicz  Conjectures 'R Us  22  20091229 20:21 
Sieving Riesel & Sierp base 16  gd_barnes  Conjectures 'R Us  13  20091214 09:23 
Sierpinski/ Riesel bases 6 to 18  robert44444uk  Conjectures 'R Us  139  20071217 05:17 