mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Riesel Prime Search (https://www.mersenneforum.org/forumdisplay.php?f=59)
-   -   Choose your own K and work on finding a top-5000 prime! (https://www.mersenneforum.org/showthread.php?t=4963)

Templus 2005-11-21 23:17

Sieved until 250G, tested until 207k and 12750 tests left until 300k. I'm planning to sieve it to at least 500G.

lsoule 2005-11-21 23:47

Found a prime for k=264766425 at n=228165. Only checked up to 230k
so far.

grobie 2005-11-24 12:44

question, with the above k's are we searching the whole k for all primes or are we just starting at reportable prime n value? Also do we need to send results to someone or just save them? I know my question is a matter of choice but I just want clarification what RPS recommends. Thanks

Templus 2005-11-24 14:24

The minimum n-value that the prime-database accepts lies around n=203000.
So I made a sieve file for 230000<n<300000. First I will test this range, and maybe for the figures I will test the range 1<n<203000 in the future.
My first objective is to find a prime for my k with an n>203000.

I save my own results files

Cruelty 2005-11-24 14:51

[QUOTE=Kosmaj]I found the weight for k=698790798615 to be 1937.

When k>2^31 it has to be given to NewPGen as a product of factors less than 2^31. In the example above, k=1763*396364605. If such factorization does't exist then such k cannot be sieved using NewPgen.

Also, when using NewPGen be sure to check the "Verify results" box. There were reports of wrong results if it's not checked. I also log the removed numbers (Options-->Log the numbers removed).
[/QUOTE]
IMO: This is some important information, perhaps it should be put somewhere on this forum as a guide.
Besides what do you mean by wrong results? Does newpgen fail to detect factor (not critical) or falsely reports factor (critical).

grobie 2005-11-24 15:45

[QUOTE=Templus]The minimum n-value that the prime-database accepts lies around n=203000.
So I made a sieve file for 230000<n<300000. First I will test this range, and maybe for the figures I will test the range 1<n<203000 in the future.
My first objective is to find a prime for my k with an n>203000.

I save my own results files[/QUOTE]

You shouldnt have to test 1 thru 10k in the above k's. Or am I wrong?

lsoule 2005-11-24 20:42

The range n=0-10k has already been tested for these ks. My usual
practice is to try is from the minimum reportable range up to 250 or 300k.
If it's productive, I'll then go back and test the 10-200k range.
There is no real requirement here - just do it the way you find most
interesting.

grobie 2005-11-25 10:49

Going to try 850612425 after my 1st drive tests are done.

BotXXX 2005-11-25 13:23

Stopping with k 8288233
 
k=8288233

LLR'ed
2000 < n < 491923

prime
8288233*2^148699-1 (but to small for top 5000 list)

Has a low weight so many candidates are easly sieved out. If some one is intressted to continue sieving/llr'ing just make is a bit easier and grab the following two:

[url]http://1202.org/download/k15_8288233.out[/url]
[url]http://1202.org/download/lresults.txt[/url]

lsoule 2005-11-25 23:42

Found a prime for k=264766425 at n=239217

NiceMedTexMD 2005-12-05 03:09

Could someone explain to me in basic steps (i'm not as computer literate) how I would reserve a k, run it for a few weeks, and hopefully find a bunch of primes?

I know how to run the LLR program, but that's about it so far...

Mike... :cry:


All times are UTC. The time now is 17:32.

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