20051205, 09:48  #23 
Nov 2003
7046_{8} Posts 
Selecting your k is the easiest part, just get an available one from the first post in the thread. Then you will have to sieve the candidates using NewPGen, it's a free software, get it from the link.
Suppose your k=165, create a new folder and name it "165", unzip NewPGen in that folder and start it, than in NewPGen: 1) Select "Create a new file" 2) Enter the name of the output file, for example "165.txt" 3) Go to "Type", select "k.b^n1 with k fixed" by scrolling it down 4) Set base=2, k=165 (your k), nmin=210000, nmax=400000. 5) Check "Verify results" 6) Select "Options", check "Log the numbers removed", and also check "Use two save files". 7) Click "Start" and let it run for 72 hours or until the sieving bound is 500 billion or more (displayed at the bottom of the NewPGen window). Then stop NewPGen and feed the file from Step (2) above to LLR. If you have a variety of machines then run NewPGen on Athlon (or Duron, Opteron, or Pentium3) and run LLR on Pentium4. The same applies to k*2^n1, k<300 where you asked the same question but I couldn't find time to reply. Over there the bounds in Step (4) will be different since many k's are already checked. 
20051205, 09:57  #24 
Mar 2004
Belgium
839 Posts 
Reserving 3250995
I will check from 10k => 300K. My upper sieve limit will be 500G. Regards, Last fiddled with by ValerieVonck on 20051205 at 10:04 
20051205, 11:40  #25 
Nov 2003
2·1,811 Posts 
The sieving bound depends a lot on nmin and nmax (and in general case on k, but these are all highweight ones, so it doesn't matter). If you go from nmin=10k you can stop sieving early, say at 20G, divide the NewPGen file into two parts, say to n=50k and the rest and then start LLR on the 1050k range while keep on sieving 50300k.
Also note that currently the "water line" to enter Top5000 is at about n=207k, and if you go from n=10k by the time you reach 207k it will be already at 210k, that's why I suggested 210k above. 
20051205, 17:14  #26  
Mar 2004
Belgium
839 Posts 
Quote:


20051205, 22:29  #27  
Nov 2003
2×1,811 Posts 
Quote:
Last fiddled with by lsoule on 20051205 at 23:55 

20051205, 23:53  #28 
Sep 2002
2^{2}×3×5×13 Posts 
Kosmaj, there's some kind of problem with the link in your post to the Low Weight Stats page. It won't load properly.

20051205, 23:56  #29 
Nov 2004
California
2^{3}×3×71 Posts 
I've fixed the link  the .htm suffix was mixed up.

20051206, 20:30  #30 
Jun 2004
2×53 Posts 
I sieved the file provided by BotXXX a bit more until 30bn. Anyone who wants this sieve file can mail or PM me.
k=10813783 has been tested until n=710000, 200 tests left until n=1M 
20051207, 01:16  #31 
Jun 2004
2×3×7 Posts 
my reservation...
reserving 39418665 please...
wish me luck... 
20051207, 01:29  #32 
Jun 2004
101010_{2} Posts 
when i'm running newpgen, I get a low rate... (1 n every xx seconds..) what kind of a rate should I get?
Mike.. 
20051207, 01:44  #33 
Nov 2004
California
2^{3}×3×71 Posts 
It should start high but then drop off pretty quickly. Once you've sieved
up to 100M, the rate will probably be 1 per every second or two. Past that, the rate will keep dropping. You can switch over to LLR when the rate is roughly equal to what it takes to run LLR on one candidate (or probably sieve past this since you'll start LLR at the lowest n and work upwards where LLR will be slower). 
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 