20110722, 19:18  #265  
Mar 2006
Germany
5317_{8} Posts 
Quote:
So the result file also contains such lines. Edit the resultfile with the 'normal' header for LLR like: 1:M:1:2:258 and replace the wrong kvalue with "11235813213455". Easier way: use srsieve. Call srsieve as follows: srsieve f G N 1000000 P 100000000 "11235813213455*2^n1" f write found factors to srfactors.txt (not needed really) G create a prpresultfile called "t17_b2.prp" N max nvalue (n 0 omitted) P max sieve depth and the sequence to search for. You'll get something like Code:
47345069:M:1:2:258 11235813213455 4 11235813213455 28 11235813213455 60 11235813213455 64 11235813213455 108 11235813213455 124 11235813213455 160 Please read more about the options of srsieve and the tool srfile to convert resultfiles. Srsieve is much faster and will find small primes (nvalues < 50, NewPGen won't!) for such a sequence. 

20110722, 21:47  #266  
Jul 2011
3^{2}×13 Posts 
Quote:
You are not kidding, thanks! I sieved the exponent up to 1,000,000 and the prime max to 10,000,000,000 and it didn't even take half an hour! That is what I call really fast! I left off the f option but I did pipe the entire console window output to a text file with: srsieve G N 1000000 P 10000000000 "11235813213455*2^n1" > my_results.txt I couldn't read anything as it flew by! This program is really awesome, thanks again. 

20110722, 21:52  #267 
Jul 2011
1110101_{2} Posts 
Riesel primes with k = 11235813213455 are prime with n =
4,28,108,124,2524,2540,7388,11584,14196,16948, 20796,38184,46592,64464 Still searching up to n = 100K. 
20110722, 22:32  #268 
Jul 2011
3^{2}·13 Posts 
Riesel primes with k = 1123581321345589 are prime with n =
17, 19, 125, 449, 565, 1339, 2767, 8237, 9665, 17849 still searching up to 100K 
20110723, 00:19  #269 
Jul 2011
165_{8} Posts 
So kar_bon doesn't go crazy
PRIME REPORT (updates in bold) Riesel primes with k = 11235813 exist for n = 2, 23, 26, 28, 80, 83, 98, 127, 152, 182, 347, 388, 392, 400, 416, 542, 830, 839, 1292, 1436, 2572, 4280, 9724, 13843, 15992, 17084, 34076, 44483, 45692, 52036, 85864, 97640, 113716, 161927 Searched up to: 270K  Riesel primes with k = 1123581321 exist for n = 33, 42, 117, 157, 177, 373, 870, 2077, 2977, 6874, 7065, 10663, 11410, 16705, 17973, 35698, 52353, 64050, 64702, 64857 Searched up to: 100K  Riesel primes with k = 11235813213455 exist for n = 4, 28, 108, 124, 2524, 2540, 7388, 11584, 14196, 16948, 20796, 38184, 46592, 64464, 77260 Searched up to: 100K  Riesel primes with k = 1123581321345589 exist for n = 17, 19, 125, 449, 565, 1339, 2767, 8237, 9665, 17849, 67987 Searched up to: 68K 
20110723, 00:40  #270 
Mar 2006
Germany
5317_{8} Posts 
Don't worry, all is online!
Another hint and a help for me: If an odd kvalue is divisible by 3, there could exist twin primes for the nvalues found (i.e. k*2^n1 and k*2^n+1 are prime). You can easily test this: edit the header of your LLRinput file from xxxx:M:1:2:258 into xxxx::P:1:2:257 and run this 'new' file as input for LLR (with a new output file for the primes). Posting both side primes will save me some time here. Thanks. Last fiddled with by kar_bon on 20110723 at 00:59 
20110723, 03:04  #271 
"Curtis"
Feb 2005
Riverside, CA
2×2,003 Posts 
SaneMur:
You don't need to post updates on your progress on a daily basis. I suggest posting found primes when you reach 500k, or whatever the cutoff is for top5000 list (currently 667k, I believe), or perhaps both. Any results that can be found in a day or two amount to clutter in the forum but a monthly update is most welcome, even if you don't reach 500k in that time. If you read through this thread you are posting in, you'll see that updates are not terribly frequent, yet are still somewhat regular either by Big Round Number or by time. Curtis Edit: Even better, use the "post small primes here and tell us about your progress" thread for these updates below 667k that thread is designed exactly for folks like you who are just starting out and playing with small primes. Last fiddled with by VBCurtis on 20110723 at 03:08 
20110723, 16:05  #272 
Jul 2011
117_{10} Posts 

20110723, 16:33  #273  
Jul 2011
3^{2}×13 Posts 
Quote:


20110723, 16:44  #274  
Feb 2003
11101101101_{2} Posts 
Quote:
Otherwise he would rerun the whole file, which is obviously not properly sieved for the k*2^n+1 side... 

20110723, 21:16  #275 
Mar 2006
Germany
2,767 Posts 
Sure, misleading used phrase of mine. Thanks for the remark.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Best Work for Finding Primes  Unregistered  Information & Answers  9  20120624 13:50 
Which settings to choose for best work?  jmb1982  Software  2  20090407 09:33 
Help test 210885  Find a new top 5000 prime!  SlashDude  Riesel Prime Search  121  20080103 08:47 
Help test 2995125705  Find a new top 5000 prime!  SlashDude  Riesel Prime Search  538  20070508 01:42 
The fastest way to a top5000 prime?  lsoule  15k Search  13  20050919 20:24 