mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Riesel Prime Search

Reply
 
Thread Tools
Old 2005-12-05, 09:48   #23
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2·1,811 Posts
Default

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^n-1 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 Pentium-3) and run LLR on Pentium-4.

The same applies to k*2^n-1, 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.
Kosmaj is offline   Reply With Quote
Old 2005-12-05, 09:57   #24
ValerieVonck
 
ValerieVonck's Avatar
 
Mar 2004
Belgium

11010001012 Posts
Default

Reserving 3250995

I will check from 10k => 300K.
My upper sieve limit will be 500G.

Regards,

Last fiddled with by ValerieVonck on 2005-12-05 at 10:04
ValerieVonck is offline   Reply With Quote
Old 2005-12-05, 11:40   #25
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2·1,811 Posts
Default

The sieving bound depends a lot on nmin and nmax (and in general case on k, but these are all high-weight 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 10-50k range while keep on sieving 50-300k.

Also note that currently the "water line" to enter Top-5000 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.
Kosmaj is offline   Reply With Quote
Old 2005-12-05, 17:14   #26
ValerieVonck
 
ValerieVonck's Avatar
 
Mar 2004
Belgium

33·31 Posts
Default

Quote:
Originally Posted by Kosmaj
The sieving bound depends a lot on nmin and nmax (and in general case on k, but these are all high-weight 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 10-50k range while keep on sieving 50-300k.

Also note that currently the "water line" to enter Top-5000 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.
Thank you for claryfing things
ValerieVonck is offline   Reply With Quote
Old 2005-12-05, 22:29   #27
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2·1,811 Posts
Default

Quote:
Originally Posted by BotXXX
k=8288233

LLR'ed
2000 < n < 491923

prime
8288233*2^148699-1 (but to small for top 5000 list)
Thanks, I just updated the Stats Low Weight. But I think you should have sieved more, I just tried and removed next 23 candidates at the rate of "1 n every 52 sec."

Last fiddled with by lsoule on 2005-12-05 at 23:55
Kosmaj is offline   Reply With Quote
Old 2005-12-05, 23:53   #28
Jwb52z
 
Jwb52z's Avatar
 
Sep 2002

14038 Posts
Default

Kosmaj, there's some kind of problem with the link in your post to the Low Weight Stats page. It won't load properly.
Jwb52z is offline   Reply With Quote
Old 2005-12-05, 23:56   #29
lsoule
 
lsoule's Avatar
 
Nov 2004
California

23·3·71 Posts
Default

I've fixed the link - the .htm suffix was mixed up.
lsoule is offline   Reply With Quote
Old 2005-12-06, 20:30   #30
Templus
 
Templus's Avatar
 
Jun 2004

2×53 Posts
Default

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
Templus is offline   Reply With Quote
Old 2005-12-07, 01:16   #31
NiceMedTexMD
 
Jun 2004

1010102 Posts
Talking my reservation...

reserving 39418665 please...

wish me luck...
NiceMedTexMD is offline   Reply With Quote
Old 2005-12-07, 01:29   #32
NiceMedTexMD
 
Jun 2004

2·3·7 Posts
Question

when i'm running newpgen, I get a low rate... (1 n every xx seconds..) what kind of a rate should I get?

Mike..
NiceMedTexMD is offline   Reply With Quote
Old 2005-12-07, 01:44   #33
lsoule
 
lsoule's Avatar
 
Nov 2004
California

23×3×71 Posts
Default

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).
lsoule is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Best Work for Finding Primes Unregistered Information & Answers 9 2012-06-24 13:50
Which settings to choose for best work? jmb1982 Software 2 2009-04-07 09:33
Help test 210885 - Find a new top 5000 prime! SlashDude Riesel Prime Search 121 2008-01-03 08:47
Help test 2995125705 - Find a new top 5000 prime! SlashDude Riesel Prime Search 538 2007-05-08 01:42
The fastest way to a top-5000 prime? lsoule 15k Search 13 2005-09-19 20:24

All times are UTC. The time now is 09:55.

Tue Nov 24 09:55:59 UTC 2020 up 75 days, 7:06, 4 users, load averages: 2.61, 2.54, 2.63

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.