11)
Message boards :
Sierpinski/Riesel Base 5 Problem :
First Prime(s)!
(Message 66894)
Posted 2863 days ago by Janita
I would bet a prime has been found for 243686*5^n1. On the stat page it looks peculiar as it does not get new candiates to be tested.

12)
Message boards :
The Riesel Problem :
Chance of TRP Prime
(Message 66238)
Posted 2880 days ago by Janita
If only one k would be pushed forward I would prefer 9221 as those tests run significantly faster on my computers.

13)
Message boards :
The Riesel Problem :
Chance of TRP Prime
(Message 66109)
Posted 2882 days ago by Janita
Interesting, your first place guess was in the list of found primes.
My curiosity lets me ask one more question: How many primes would you have anticipated at PrimeGrid's start of the TRPproject for the range of n=3M to n=6M?

14)
Message boards :
The Riesel Problem :
Chance of TRP Prime
(Message 65987)
Posted 2884 days ago by Janita
I think it would be interesting to see which k's you would have preferred if you would have calculated the probabilities of all of the original 64 candidates in the nrange of 3M to 10M. If your prediction would have resulted in more hits than falses with respect to the nine primes we have found so far it could be worthwile to push two of the k's forward at higher speed. But I remember that I have checked how many tests were avoided by the first finds and it were not the biggest numbers of tests for the deleted k so I guess your method has a good chance to fail. Anyway, the target of this TRP excercise is to prove that a prime exists for every remaining k. Therefore it does not really matter when they are found. But yes, it is time for another one as there was for so long no hit...

15)
Message boards :
The Riesel Problem :
TRP DC Effort
(Message 62164)
Posted 3000 days ago by Janita
Will "my" prime (252191*2^54978781)  which is btw. still missing on the PrimeGrid front page in the list of significant primes  also be included in the double check effort?

16)
Message boards :
The Riesel Problem :
TRP DC Effort
(Message 57111)
Posted 3170 days ago by Janita
Is the prime for k=415267 just below n=3M real? There was one found for n=3771929 last year in May which would then not be the smallest one.

17)
Message boards :
Sophie Germain Prime Search :
Start a new SG sieve ??.
(Message 53370)
Posted 3284 days ago by Janita
Intel Celeron M, 1,5 GHz, 496 MB RAM, Windows XP Home, Version 2002, SP3
As my laptop is not really fast I stopped the calculations after the first 10000 cycles and estimated the total run time by simple multiplication. I hope that is valid and still useful.
10000001535*2^12100011
Using zeropadded Core2 type3 FFT length 128K, Pass1=512, Pass2=256 V1 = 5
iteration : 10000 / 1210001 [0.82%]. Time per iteration : 10.432 ms. => estimated 12623 sec in total
10000000221*2^12300011
Using zeropadded Core2 type3 FFT length 128K, Pass1=512, Pass2=256 V1 = 5
iteration : 10000 / 1230001 [0.81%]. Time per iteration : 10.413 ms. => estimated 12808 sec in total
10000000155*2^12500011
Using zeropadded Core2 type3 FFT length 128K, Pass1=512, Pass2=256 V1 = 5
iteration : 10000 / 1250001 [0.79%]. Time per iteration : 10.424 ms. => estimated 13030 sec in total
10000000065*2^12700011
Using zeropadded Core2 type3 FFT length 128K, Pass1=512, Pass2=256 V1 = 5
iteration : 10000 / 1270001 [0.78%]. Time per iteration : 10.551 ms. => estimated 13400 sec in total
10000000299*2^12900011
Using zeropadded Core2 type3 FFT length 128K, Pass1=512, Pass2=256 V1 = 3
iteration : 10000 / 1290001 [0.77%]. Time per iteration : 10.436 ms. => estimated 13462 sec in total
10000001091*2^13100011
Using zeropadded Core2 type1 FFT length 144K, Pass1=96, Pass2=1536 V1 = 5
iteration : 10000 / 1310001 [0.76%]. Time per iteration : 11.413 ms. => estimated 14951 sec in total

18)
Message boards :
The Riesel Problem :
TRP LLR Discussion
(Message 27436)
Posted 3826 days ago by Janita
Would it be possible to display the number that has been tested for primality for TRPLLR tasks (and also for SOBLLR) on their workunit pages as it is done for all other LLRprojects? It would satisfy my curiosity.
Also, would it be possible to display n for found primes in the last column on the stats pages for the LLRprojects that search for only one prime per k (TRP, PSP, SOB)? Since these primes are only found very rarely (so far three PSP's if I count correctly) they could possibly even be added manually to the tables without too much effort. This way it would immediately be clear why a row is green (currently no task in progress or indeed a finished k).
Thanks!
