Reserving k=684255

1 Attachment(s)
k=1121 done to n=300k, 3 primes for 10k300k as shown in primes thread. i'll release this k now.

Reserving k=2385
[QUOTE=grobie;133543]Reserving k=684255[/QUOTE]
I am going to let this k go. If anyone wants the sieve file PM me, it is only sieved to 340G I am going to reserve k=2385 from n=10k 
I'd like to search a k value that hasn't really been done at all yet (or at least not past 10K), so that I can find a few small primes at first to give me something to look at. But I also would like that k value to have reasonable potential for producing a top5000 prime if I were to continue the search to high n values. (or are top5000 primes not likely to be found quickly for k's that havent been tested to >10k yet?)
Can you suggest what range of k values I should be looking at. And, within that range, what makes a particular k value appealing over others? Is the number of primes found for n<10k a good predictor for future primes? I've been glancing through posts on this forum and seen some data on websites, but a lot of it seems old/outdated, so I'm just curious where would be a good place to search given that I'm starting now? 
Greetings,
I've now access to a 24/7 quadcore machine for at least two months, so my res lack has found an end for now. I decided to reserve a lower and more lightweight k than 19217385 also, it's 1443. Search is now at 235k, primes will follow soon. Regards nugget 
1443
Primes upto 235k(from 10k):
12716 17183 22232 23930 24367 29674 37120 63208 68702 89252 222272 Regards, nuggetprime 
1443
Now at 300k. Sieving to 700k started.
One more prime found at n=268111. nugget 
to nuggetprime/sps27:
please refer to [url]http://www.rieselprime.org[/url] and on the left menu the pages for all k's. the last update dates are not correct, please see the page itself! in the near future i will update all these datapages with all infos from this forum and Top5000 primes. for 1443 the range upto 35k was already searched! to sps27: to choose a k for testing look the k's listed on these pages. a hint: a k with a small Nash weight means: there are not so many candidates to test upto higher ranges (eg. about 1000 pairs to test upto n=1Million). but the chance to find a prime is low too. a k with a high Nashweight means: there're many pairs to test (eg. 50000 upto 1M) but the chance is higher to find a prime. so play with some k's and choose one. 
@ kar_bon
yes, i didn't find the page first, but no problem , I wasted some cpu minutes,nothing more:smile:. regards, nugget 
Well I'm working on k=35779
I'm at n=294k so far: 35779 37 35779 69 35779 79 35779 211 35779 265 35779 349 35779 411 35779 447 35779 489 35779 801 35779 2089 35779 2977 35779 3261 35779 3739 35779 3961 35779 4647 35779 6921 35779 19225 35779 23037 35779 26145 35779 29817 35779 39405 35779 41727 35779 60051 35779 76335 35779 106141 35779 268195 
sps
The LLR software's method for testing k*2^n1 (riesel numbers) takes somewhat longer for higher k values. A kvalue in the 30,000 area might take 1015% longer per test than a k near 1000 (this is guesswork, as I don't have data handy for a k near yours). The probability a given single test comes up prime is independent of the kvalue, according to theory; it is affected by the depth of your sieve and the size of the exponent in the test. Put these two observations together, and your chosen k will take some amount of time longer (perhaps 15%) to find each prime than an otherwise identicallyperforming k in the 10002000 range. This is why those lower k's are popular. When you tire of your current k, or run out of sieve, consider an untested (past 10,000) k value from the pages karbon referred to in the 10003000 area. The good news about picking a k in the range you chose is that is it very very unlikely anyone has tested it before that security may be worth the timepertest penalty. It's fun to just jump in and try something on your own, too 15% isn't very significant in the grand scheme of things, esp when trying new things out. Curtis 
1 Attachment(s)
I still have quite a large number of results on my PC from a while ago. I was doing some investigating of prime density and searched quite a few ranges along the way.
I think that some may already be on 15k, but the majority are not. 
[quote=sps27;138188]Well I'm working on k=35779
I'm at n=294k so far: 35779 37 35779 69 35779 79 35779 211 35779 265 35779 349 35779 411 35779 447 35779 489 35779 801 35779 2089 35779 2977 35779 3261 35779 3739 35779 3961 35779 4647 35779 6921 35779 19225 35779 23037 35779 26145 35779 29817 35779 39405 35779 41727 35779 60051 35779 76335 35779 106141 35779 268195[/quote] n=7, i.e. 35779*2^71 is also prime NewPGen erroneously removes small nvalues when sieving. If using NewPGen for sieving, you have to manually test anything where 35779*2^n1 is less than the depth of your sieve. In this case, NewPGen assumed that 35779*2^71=4579711 has a factor of 4579711 and so removed it when the sieve depth got that high even though it is prime. I verified that was the only one missing up to your first listed prime at n=37. Gary 
to sps27:
your k is in the summary pages, the missing n too. to lavalamp: that's what i'm looking for. i try to include all results with twins, if any, in the next update! thanks. 
[quote=kar_bon;138287]to sps27:
your k is in the summary pages, the missing n too. to lavalamp: that's what i'm looking for. i try to include all results with twins, if any, in the next update! thanks.[/quote] Karsten, I don't see k=35779 in the summary pages. I am looking at rieselprime.org [URL="http://www.rieselprime.org/Summary10e04.htm#n04.3"]here[/URL]. The last update is July 16th. I also don't see it at rieselprime.de. Gary 
yes, sorry.
i wrote the post before uploading the files. i got no response from [url]www.rieselprime.org[/url] (today too) so i uploaded now all datafiles to [url]www.rieselprime.de[/url]. please refer there for now. 
1443
At 415k so far. no new primes.
nuggetprime 
[QUOTE=kar_bon;138336]yes, sorry.
i wrote the post before uploading the files. i got no response from [url]www.rieselprime.org[/url] (today too) so i uploaded now all datafiles to [url]www.rieselprime.de[/url]. please refer there for now.[/QUOTE] today i uploaded all changed files to [url]www.rieselprime.org[/url] without any problems so please refer to this. i included all data for 1001<=k<=1999 and 10k<=n<=35k into the summary pages (data from henryzz and me). data for many k's (from 20000 to 200000 and mostly n<=10k) from lavalamp will follow. 
1443
At 500k(no new primes). pausing primesearch now a bit and try a few factorizations.
nugget 
35779 tested to 600k now... one new prime found:
346735 
k=443 tested to 1040k. No primes, alas.
Curtis 
k=15431 & newbie stuff
Was thinking of having a go at k=15431 if it's free  can't see any signs of it having been heavily done before?
Also, I'm a bit of newbie about doing all of this by hand, and the previous howtos refer to NewPGen  is there a more recent howto that covers srsieve variants? Thanks, \/ato 
Vato
Welcome to RPS!
You are right, nobody did k=15431 before. It's yours! It's the best to start sieving using NewPGen, upto p=50 or 100bn, and then to switch to srsieve. Suppose that your NewPGen output file is called "15431.txt", then you can start srsieve on the command line as follows: > sr1sieve i 15431.txt o 15431.txt P 3E12 It will sieve to 3T but you can stop it earlier if you want. Happy hunting! 
Personally I now start sieving with srsieve, then move onto sr1sieve. This is because [url=http://www.mersenneforum.org/showthread.php?t=10529]NewPGen misses factors[/url] and is no longer being actively developed.
If you're on windows, you could put these commands in a batch file and run it to create a sieve:[code]srsieve v g m 4e15 P 1e10 n 0 N 101419 "15431*2^n1" ren "t17_b2_k15431.npg" "15431_sieve.txt" pause[/code]That command will sieve 15431*2^n1 for n up to 101,419 which is an Intel CPU FFT jump point. If you have an AMD CPU under the hood, you might want to change that to 102,919 for the corresponding AMD jump point. It will sieve to a depth of 10 billion, at which point I would recommend switching to sr1sieve. The ren command simply renames the output file to something more friendly, and the pause command holds the batch file window open when it's done so that you can read any output. If you want to know what all of the other switches in that command line do, just run srsieve h, and likewise sr1sieve h for sr1sieve. Sieving and LLRing a k up to n=101,419 (or n=102,919) will take maybe 1  2 weeks *, depending on how fast your CPU is and how many candidates are removed while sieving. To get those jump points I used [url=http://www.mersenneforum.org/showpost.php?p=62303&postcount=36]llrtools[/url]. * completely wild guess 
New k
OK, I'll take over k=10544249 until 1M.
Personally, I also use srsieve, so... Alexander Jones 
taking 20934375

Status report
k=1515 tested till n=1.04M
k=12345 tested till n=1.04M I am still working on the above. k=617 tested till n=1.2M  testing suspended k=151515 tested till n=1.1M  releasing this k k=736320585 tested till n=860k  testing suspended 
Reserving 432383773965*2^n1 Nash Weight 7788
Thanks cipher P.S: Special Thanks to Thomas11 for helping me find a "Real Heavy K" 
[SIZE=6][B]432383773965 has [U]100 Primes between n=0 to n=50k[/U][/B][/SIZE]
[CODE] 432383773965 3 432383773965 4 432383773965 6 432383773965 7 432383773965 10 432383773965 11 432383773965 12 432383773965 18 432383773965 19 432383773965 20 432383773965 23 432383773965 39 432383773965 47 432383773965 61 432383773965 64 432383773965 72 432383773965 73 432383773965 84 432383773965 93 432383773965 94 432383773965 109 432383773965 123 432383773965 127 432383773965 141 432383773965 145 432383773965 161 432383773965 163 432383773965 183 432383773965 223 432383773965 227 432383773965 232 432383773965 259 432383773965 321 432383773965 322 432383773965 326 432383773965 329 432383773965 337 432383773965 340 432383773965 349 432383773965 368 432383773965 426 432383773965 501 432383773965 551 432383773965 553 432383773965 801 432383773965 802 432383773965 890 432383773965 902 432383773965 928 432383773965 1067 432383773965 1106 432383773965 1379 432383773965 1444 432383773965 1499 432383773965 1557 432383773965 1698 432383773965 1774 432383773965 2207 432383773965 2426 432383773965 2606 432383773965 3142 432383773965 3313 432383773965 3622 432383773965 3773 432383773965 3789 432383773965 4103 432383773965 4482 432383773965 4573 432383773965 5445 432383773965 5551 432383773965 5616 432383773965 6188 432383773965 6408 432383773965 7532 432383773965 7593 432383773965 8072 432383773965 8365 432383773965 8571 432383773965 8878 432383773965 9133 432383773965 9870 432383773965 9972 432383773965 12569 432383773965 13543 432383773965 16515 432383773965 17635 432383773965 19586 432383773965 21595 432383773965 21784 432383773965 22184 432383773965 26754 432383773965 29867 432383773965 30984 432383773965 32862 432383773965 36069 432383773965 37967 432383773965 38113 432383773965 40197 432383773965 45654 432383773965 48611[/CODE] Next update when i reach 250k or sooner. 
Status report
k=1515 tested till n=1.05M
k=12345 tested till n=1.05M I am still working on those. 
I think this is as good a place as any to post this:
NPLB will be pulling out active reserved k's from it's upcoming k=20003400 efforts. I have sent PM's to 3 people about some reservations that have not had a search depth reported for 612 months to verify that they are still working on them. Please see details in the applicable [URL="http://www.mersenneforum.org/showpost.php?p=177212&postcount=1"]posting[/URL] in our thread. If any problems, please let me know. Best would be to reply in that thread or to send me a PM. Thanks, Gary 
[quote=lavalamp;158336]Personally I now start sieving with srsieve, then move onto sr1sieve. This is because [URL="http://www.mersenneforum.org/showthread.php?t=10529"]NewPGen misses factors[/URL] and is no longer being actively developed.
If you're on windows, you could put these commands in a batch file and run it to create a sieve:[code]srsieve v g m 4e15 P 1e10 n 0 N 101419 "15431*2^n1" ren "t17_b2_k15431.npg" "15431_sieve.txt" pause[/code]That command will sieve 15431*2^n1 for n up to 101,419 which is an Intel CPU FFT jump point. If you have an AMD CPU under the hood, you might want to change that to 102,919 for the corresponding AMD jump point. It will sieve to a depth of 10 billion, at which point I would recommend switching to sr1sieve. The ren command simply renames the output file to something more friendly, and the pause command holds the batch file window open when it's done so that you can read any output. If you want to know what all of the other switches in that command line do, just run srsieve h, and likewise sr1sieve h for sr1sieve. Sieving and LLRing a k up to n=101,419 (or n=102,919) will take maybe 1  2 weeks *, depending on how fast your CPU is and how many candidates are removed while sieving. To get those jump points I used [URL="http://www.mersenneforum.org/showpost.php?p=62303&postcount=36"]llrtools[/URL]. * completely wild guess[/quote] That sounds very intreting, but have you also a commandline for using sr2sieve in the second step? ;) I have the following idea: [quote]sr1sievex86_64windows t 2 A 1 A 2 p 1e10 P 30e12 i 15431_sieve.txt o 15431_sieve_2.txt[/quote] The filename is to keep your example. Would this line work? 
sr2sieve is for an entirely different sort of sieving, with many k values. To sieve a single k, the directions are as good as need be, and sr2 is of no help. Sr2 becomes useful when one wishes to sieve 3+ k values on identical ranges of n; its command line is similar to sr1, or it can be run from a sr2work file listing the ranges of n to search in billions.
I don't know what the t and A flags are for sr1, and I've used it many many times; what are you trying to do that's nonstandard with those? edit if they are for threads, I would like to know if much speed is gained over just running two instances of sr1sieve; I've always done without threads, but if it's faster.... Curtis 
[quote=VBCurtis;178521]I don't know what the t and A flags are for sr1, and I've used it many many times; what are you trying to do that's nonstandard with those?
edit if they are for threads, I would like to know if much speed is gained over just running two instances of sr1sieve; I've always done without threads, but if it's faster....[/quote] Yes, t is for threads (linux only AFAIK). I don't know what A is. As far as speed differences with multithreading, generally sieving is a bit faster *without* multithreading. The overhead for communication between threads is not much, but it is present nonetheless. I don't know what the exact % figures are, though, since I rarely use multithreading myself. The main benefit of multithreading is a smaller memory footprint; this can be quite useful if dealing with a very large sieve file. 
Okay thanks a lot guys. So I will use two instances instead of t switch. (Doesn´t function under windows, too) A is affinity.
Sorry, but I´m a "DAU". But after finishing srsieve I let run 2 instances of sr1sieve with the factors as output. How can I get the factors out of the sievefile after finishing? 
[QUOTE=Svenie25;178544]How can I get the factors out of the sievefile after finishing?[/QUOTE]
Just by using srfile (it comes with srsieve): [CODE]srfile k factors.txt sievefile.txt[/CODE] You can also use it to convert between the different file types (e.g. srsieve.out, abcd, NewPGen, etc. ...) 
Status report
k=1515 tested till n=1.07M
k=12345 tested till n=1.07M I am still working on those. 
Reserving k=49185
Hi
Though I'm new here, I think this is the right place to put the reservation for following Riesel prime k: 49185! I have already begun testing and know for a fact that there is 49 primes for n<=1K. I hope someone can tell me if this was the right place to post the kreservation, and eventually tell me where to post the primes (most preferably in a PM) that I find, even though I think that I'll email them to Karsten as they appears. I choose this k since it was of those 44461 k's untested from k>10000 to k<=100K, the most primeproducing k. There is a total of 25 other k's which also produced at least 40 primes for n<=1K. The k's is a follows: 10209 13419 19995 23205 26697 30345 32835 33585 34515 38685 46665 66975 68367 75915 77805 80535 84405 87645 89001 92655 93765 96045 97005 97845 98685 Hope this was usefull for anyone. Just to make it clear, I'm only reserving: k=49185 Regards KEP 
KEP
Yes, this is the right place to make your reservation. You can post small primes (below the Top5000 level) in the [URL="http://www.mersenneforum.org/showthread.php?t=2150"]Post small primes[/URL] thread, and larger ones in the "Post a lot of primes" thread. Thanks, Kosmaj 
Thanks Kosmaj!
I'll will this instant bookmark these 2 mentioned threads and as soon as I reach an important milestone or a reasonable progress, I'll post the primes found and post a progress report :smile: Thanks again. Regards KEP 
Status report
k=1515 tested till n=1.09M
k=12345 tested till n=1.09M I am still working on those. 
reserving 719053335

I will reserve 20934375.

"I will reserve 20934375."
Oops, I guess someone already took that number... I will choose a different one. I will reserve: 19474455. Please someone tell me if that is taken too. 
i have that number sab.im nearly finished it up to 320000,il be unreserving it at that,you can have it if you want.

Mike and Sab  Welome to RPS.

reserving 1748348745

[quote=Dougal;184849]i have that number sab.im nearly finished it up to 320000,il be unreserving it at that,you can have it if you want.[/quote]
That's ok, but I'm going to be testing 19474455 for a while. I already tested numbers with n up to 191000. I recently opened up another core to start testing at n=450000 (the top 5000 range). I found about 5 or 6 primes from n=50000 to n=191000. 
Status report
k=1515 tested till n=1.1M
k=12345 tested till n=1.1M I am still working on those. 
k=415 is tested to 1M and released.
k=1585 is tested to 750k and released. k=405 is tested to 741k, still working on this. k=443 is complete to 1045k, and is now in the big Cruelty sieve, so progress will be delayed a couple months. I am now sieving this to 5M. Curtis 
reserving 1194281385

hi all,
i have problems to find out which k is free and what was the last tested n. all tables seems to be outdated. i am interested in these k: {2001, 2011, 2013, 2019, 27114615}. thanks for your assistance grueny 
[QUOTE=grueny;222763]
i am interested in these k: {2001, 2011, 2013, 2019, 27114615}. [/QUOTE] Hi Grueny, and welcome to RPS! A good source about reservations and testing limits is the Karsten's page: [URL="http://www.rieselprime.de/"]http://www.rieselprime.de/[/URL] As far as I know, 20012019 are currently processed by the NPLB project. But 27114615 may be available from n=50k... Good luck! Thomas 
[quote=Thomas11;222854]As far as I know, 20012019 are currently processed by the NPLB project.
But 27114615 may be available from n=50k...[/quote] Yes, we are covering k=20003000 with our 11th and 12th Drives. (FYI, we are also doing k=30003200 in a minidrive, and 32003400 is sieved but awaiting further testing; so the first completely "clean" k's start at 3401, I think.) 
[QUOTE=mdettweiler;222861] [...] so the first completely "clean" k's start at 3401, I think.)[/QUOTE]
That range is covered by FreeDC Drive #1: n=405k to 600k. k=40004200 is tested by D.Mecalfe. k=50006000 is reserved by J.Van Klein to n=1M, but no results since a year. I think, I should make a graph with those whole reservations as quick reference. 
thanks!
i found the sites! will first do some runtime tests before reservation. grueny 
k=405 complete to 1M, continuing.
k=443 complete to 1.1M. I plan to have 443 to 1.5M by 1 Jan. Curtis 
updates
k = 2055
2085 2115 2175 have been tested up to 600k. Also reserving k = 2145 to be tested from 600k & up. Steven 
8331405 tested up to 1.3M and continuing

reserving 1310150985

8331405 tested up to 1.7M and continuing

k = 4191 tested up to 50000.
Working on up to 100000 now. 29 primes found so far. I reported to [B]kar_bon[/B] already. 
reserving k = 11235813
Disregard that previous post, I did not see that k = 4191 was being worked on.
I now am solving Riesel primes with k = 11235813. So far I have found 30: 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. The largest number is: (11235813 * (2^52036))  1 = 2801940272766737154639948929026511054003024516612799660 1216299242979042962235051477521474844041059710452756351 7390729551638114159418228271846068190750962597076896256 1398371164967920509488662762593916341891162534940800942 3744937134106499649375740802252980813689557888024943950 1253820789773220892409379270600026505964071514303459653 1586225290053829886413610508428913190101932379542819530 5826290132794403803733777056167049776750282440639541230 2403438009450026907643943033291777979988314100503606167 0069565283787832444538038510766448640071805124732912189 0976099258472267418489423333057078108458824043285531633 3748589775663627407077026862533378258017559551503145197 9085472586940262611994633395148001771479048737908396690 1744177208377481925035317703120450862856791239837524931 5150869920252691061659759860727447083377787497721414337 8281790949014702226570071582471433219664179960251655349 3698073040283995206573090553980096623304858930525647383 ... 8679053305642679869211074066971707145004660876931179669 8766024730721657615614715364133617006319942454432884048 5279316246444155588348999726222847537329574752488084487 7092597942532153799038194344316851499850099980712558960 7977406501519999241895667421760993696381330112135044945 2889320803488916094164943801340752001646169710984373376 0250289074027011542951215721500132902628446938869233806 3365872298743797828656048567378721134841569116695352502 2314614431813139812258984680430650271360179597525545673 7483728173218245012307245902348341826051192919514315987 7512711923794934456914922979634431490623866967221945775 4984853824962986206257450345981331771192104300074870761 1175851978068604378303125573880000368226991177470686581 2631474839621403365315390664644233717370622060164201496 5135358766261035220408037547583559945487277226414307455 5538276853081252529855916927481283113615429499508358956 5629001235992012819796090570179633573255492965268696578 1506955672196728424054208213655309439172661234106367 
k=8331405 complete up to 2M

Additional exponents for k = 11235813:
n = 85864, 97640, 113716, 161927. And a special 'thank you' to the Micro$oft Corporation for sending me over 500 MB of "updates" last night around 3 AM, then rebooting my machine. No further sieved than ~230K I think. 
Regarding Win updates you can change your settings using the Control panel to disallow automatic reboots. Just look for the "Windows updates" icon.

[QUOTE=Kosmaj;267237]Regarding Win updates you can change your settings using the Control panel to disallow automatic reboots. Just look for the "Windows updates" icon.[/QUOTE]
Yeah, wish I knew that earlier. Now it's called "wireless router gets turned off at night"! Ha, let's see them access my system now! 
reserving:
k = 1123581321 k = 11235813213455 k = 1123581321345589 k = 1123581321345589144233 k = 1123581321345589144233377 k = 1123581321345589144233377610987 
Riesel primes with k = 1123581321 are prime with n =
33, 42, 117, 157, 177, 373, 870, 2077, 2977, 6874, 7065, 10663, 11410, 16705, 17973, 35698, 52353, 64050, 64702, 64857 I will complete this search through 100K very soon. 
k = 11235813; checked up to 250K
k = 1123581321; checked up to 100K. No primes other than what has been reported. Running 11235813 from 250K to 375K now. I tried running the NewPGen output for k = 11235813213455 into LLR, but apparently LLR can't parse the header NewPGen created: [CODE] ABC 5*389*5776767719*2^$b1 //NewPGen:3598503246:M:0:2:322 [/CODE] 5*389*5776767719 = 11235813213455, and NewPGen required entering it into the app in that format. Does this header need to be tweaked in any way to have it read by LLR? Any ideas what might be wrong? 
[QUOTE=SaneMur;267281]I tried running the NewPGen output for k = 11235813213455 into LLR, but apparently LLR can't parse the header NewPGen created:
[CODE] ABC 5*389*5776767719*2^$b1 //NewPGen:3598503246:M:0:2:322 [/CODE] 5*389*5776767719 = 11235813213455, and NewPGen required entering it into the app in that format. Does this header need to be tweaked in any way to have it read by LLR? Any ideas what might be wrong?[/QUOTE] NewPGen will create such ABCfile because (as suggested) the kvalue is too big and should be typed as factorization instead. 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 [/code] in t17_b2.prp. 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. 
[QUOTE=kar_bon;267289]
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. {...snip...} Srsieve is much faster and will find small primes (nvalues < 50, NewPGen won't!) for such a sequence.[/QUOTE] Wow! 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 [I]really [/I]fast! I left off the [B]f[/B] option but I did pipe the entire console window output to a text file with: srsieve G N 1000000 P 10000000000 "11235813213455*2^n1" [B]> my_results.txt [/B]I couldn't read anything as it flew by! This program is really awesome, thanks again. 
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. 
Riesel primes with k = 1123581321345589 are prime with n =
17, 19, 125, 449, 565, 1339, 2767, 8237, 9665, 17849 still searching up to 100K 
So kar_bon doesn't go crazy :smile:
PRIME REPORT (updates in [B]bold[/B]) Riesel primes with [U]k = 11235813[/U] 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: [B]270K[/B]  Riesel primes with [U]k = 1123581321[/U] 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: [B]100K[/B]  Riesel primes with [U]k = 11235813213455 [/U] exist for n = 4, 28, 108, 124, 2524, 2540, 7388, 11584, 14196, 16948, 20796, 38184, 46592, 64464, [B]77260[/B] Searched up to: [B]100K[/B]  Riesel primes with [U]k = 1123581321345589[/U] exist for n = 17, 19, 125, 449, 565, 1339, 2767, 8237, 9665, 17849, [B]67987[/B] Searched up to: [B]68K[/B] 
[QUOTE=SaneMur;267311]So kar_bon doesn't go crazy :smile:
[/QUOTE] Don't worry, all is online! :grin: 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 [b]and[/b] 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. 
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. 
[QUOTE=kar_bon;267312]
Posting both side primes will save me some time here. Thanks.[/QUOTE] Sure I can do that. Also: [B]Reserving k = 10000000001[/B] 
[QUOTE=VBCurtis;267321]SaneMur:
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. {snip} Edit: Even better, use the "post small primes here and tell us about your progress" thread {snip}[/QUOTE] Sure thing! 
[QUOTE=kar_bon;267312]
edit the header of your LLRinput file from xxxx:M:1:2:258 into xxxx::P:1:2:257 [/QUOTE] Shouldn't it be the LLR [B]output[/B] file (containing the primes), which he shall use as input for the "plus" side? Otherwise he would rerun the whole file, which is obviously not properly sieved for the k*2^n+1 side... 
[QUOTE=Thomas11;267361]Shouldn't it be the LLR [B]output[/B] file (containing the primes), which he shall use as input for the "plus" side?
Otherwise he would rerun the whole file, which is obviously not properly sieved for the k*2^n+1 side...[/QUOTE] Sure, misleading used phrase of mine. Thanks for the remark. 
[QUOTE=kar_bon;267374]Sure, misleading used phrase of mine. Thanks for the remark.[/QUOTE]
And what is the difference between the 258 and 257? I'd like to reserve [B]k=2889081195[/B] which has a very high Nash weight (7000+) but it has not been worked on for ages and seems to be available. If so, I'll start sieving on it when I get the approval. 
We can't really give any sort of formal approval. However, this k has clearly not been worked on for a long time so go ahead and reserve it.

[QUOTE=amphoria;267587]We can't really give any sort of formal approval. However, this k has clearly not been worked on for a long time so go ahead and reserve it.[/QUOTE]
OK. Well I will start sieving on it later tonight when I have a core freed up, no harm in doing that at least. I ordered a new computer which should be delivered one day next week. By then this k will be sieved pretty good and I'll give it to my new computer if there has been no further objections by then. 
[QUOTE=SaneMur;267578]And what is the difference between the 258 and 257?
[/QUOTE] See the file 'newpgenformats.txt' given with NewPGen.exe: [code] // Here are the NewPGen format's <sieve limit>:<mode character>:<chain len>:<base>:<mode bitmap as a decimal> Mode character: 'P' +1 'M' 1 (...) BitMap: 0x0001 k*2^n+1 k*n#+1 0x0002 k*2^n1 k*n#1 0x0004 k*b^(n+1)+1 2k*n#+1 0x0008 k*b^(n+1)1 2k*n#1 0x0010 k*b^(n1)+1 .5k*n#+1 0x0020 k*b^(n1)1 .5k*n#1 0x0040 Primorial 0x0080 3tuple and 4tuple (PLUS5  used in the triplet sieve.) 0x0100 Mode 'k' sieve (variable k's) [/code] So 258 (dez) is 102 (hex) (combination of 0x0100 and 0x0002) > "Mode 'k' sieve (variable k's)" for "k*2^n1" and 257 (dez) is 101 (hex) > "Mode 'k' sieve (variable k's)" for "k*2^n+1". 
My new computer arrived this morning, ahead of schedule, what a nice surprise.
An even better surprise: In less than 6 hours of use, it has found a top 5000 prime! I am happy to report my first top5000 prime should come in around #2209: [B](11235813 * (2^775082))  1[/B] is prime! 
SaneMur
Congratulations! Way to break in your new machine. A little beginner's luck mixed with a lot of enthusiasm it's fun to see someone find their first. Note we have a thread specifically dedicated to reporting primes now that you're finding top5000 primes, you should use that thread too. The threads are helpfully named; this current thread for reservations and occasional status updates, the prime reporting thread for just that. Curtis 
[QUOTE=VBCurtis;267978]SaneMur
Congratulations! Way to break in your new machine. A little beginner's luck mixed with a lot of enthusiasm it's fun to see someone find their first. [/QUOTE] Thanks! I'd also like to credit my 5.4 gigahertz computer! This thing is loud, heavy, and fun to watch (from the next room). This thread is called "Choose your own K and work on finding a top5000 prime!" so did I not post this in the correct place? I surely chose my own K and made it to the top 5000. 
Well Hurricane Irene was not too kind to us. No real serious damage from falling trees or anything, but lots and lots of water. Fire company had to come and pump out the basement. One of my two computers is done for (fortunately not the new one).
Just restarted doing some primes so nothing to post in terms of updates. 
k=7605
k=7605 is now at 1240k and the total of 102 primes have been found.
The first 100 primes, up to 892k, I reported [URL="http://www.mersenneforum.org/showpost.php?p=263539&postcount=369"]here[/URL] Primes found between 892k and 1240k: 7605*2^10164741 (305994 digits) 7605*2^10277191 (309379 digits) 
would like to reserve k=314159

It has been quite a long time since I updated the k's I work on above 300:
k = 405 complete to 1.41M k = 443 complete to 2.31M k = 2115 complete to 1.33M k = 2145 complete to 1.36M k = 2175 complete to 1.27M 405 and 443 ran on ancient P4celerons until recently, so progress was very slow. 405 is now on a new i3 laptop, 443 on i7 desktop. The 2000's are in cooperation with sjtjung (Steven) and chaos13 (Kristine). 
Reserving for prospecting :
k=6073 k=9461 k=9473 k=9959 Will run most until 500k or 1M and then decide whether i unreserve it or not 
k=8413 checked to 500k. No new primes. Unreserving.

k=8413
What is special about that k value?
It's not like it doesn't have any known primes (and now it has [URL="http://primes.utm.edu/primes/page.php?id=119837"]two more[/URL])... 
Searched k=6073 to 500k.
Primes for exponent: 2967 and 59931 Unreserving 6073. 
Vincent,
I think it is time to move the gibberish to misc. math. Please [URL="http://mersenneforum.org/showthread.php?t=20216"]continue your numerology there[/URL]. 
All times are UTC. The time now is 06:05. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2020, Jelsoft Enterprises Ltd.