![]() |
![]() |
#34 | |
"Mark"
Apr 2003
Between here and the
6,163 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#35 |
"Mark"
Apr 2003
Between here and the
6,163 Posts |
![]()
The range for x < 17000 has now been double-checked. No missing primes/PRPs.
|
![]() |
![]() |
![]() |
#36 |
"Mark"
Apr 2003
Between here and the
11000000100112 Posts |
![]()
The range for x < 18000 has now been double-checked. No missing primes/PRPs.
So the range from 17000 to 17999 is an outlier with only 50 PRPs. Interesting. |
![]() |
![]() |
![]() |
#37 |
"Mark"
Apr 2003
Between here and the
6,163 Posts |
![]()
I started sieving a month ago for all x where 30000 <= x < 40000 (and y < x). Sieving is very slow for such a large range. I will not continue sieving this range or test it at this time. If someone else is interested, please let met know. I will post the file of terms if there is interest. It is only sieved to about 2.6e9 and still has 5.6 million terms in the range.
I am still sieving for 20000 <= x < 30000 (and all y < x). This is also going very slowly. I doubt it will be sieved deeply enough before I finish for x < 20000, but I can split off small y (since those tests are faster) and continue sieving. It is really hard to estimate how much time it will take to test that range because test times vary considerably. It will have around 4 million terms in it. I don't know how far I will test it, but I want to test to x < 25000. Last fiddled with by rogue on 2020-10-26 at 21:22 |
![]() |
![]() |
![]() |
#38 |
"Mark"
Apr 2003
Between here and the
6,163 Posts |
![]()
The range for x < 19000 has now been double-checked. No missing primes/PRPs. There are 71 primes/PRPs in that range. I had miscounted in a table in a previous post.
|
![]() |
![]() |
![]() |
#39 |
"Mark"
Apr 2003
Between here and the
181316 Posts |
![]()
Actually there are 78 primes for 19000 <= x < 20000. I miscounted above.
All x < 20000 has now been double-checked. No missing primes/PRPs. My tactic for testing 20000 <= x < 30000 is a little different due to speed of sieving. I am testing all x in that range at once, but subdividing by y as PRP tests for smaller y are faster. I am testing for y <= 1000 while sieving for y > 1000 continues. |
![]() |
![]() |
![]() |
#40 |
"Mark"
Apr 2003
Between here and the
616310 Posts |
![]()
I have confirmed all known PRPs for x < 30000 where y < 5000. Nothing was missed by previous searchers. Since nothing was missed I am going to discontinue the double-check.
For those who are still searching other ranges for x < 30000, the attached file, sieved to 13896059123, has all x/y pairs that I have not tested for x < 30000. You can use this file in one of two ways. First, see if you tested the x/y pairs that are in this file for the ranges you have tested. Assuming that you haven't sieved as deeply as I have, then this file could have x/y pairs that you didn't test. Second, if you are searching x < 30000 and haven't sieved as deeply as I have, you can use this file to start testing those ranges sooner. |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Reservations | ET_ | Operazione Doppi Mersennes | 495 | 2020-12-19 19:41 |
Reservations for b^(k*2^n); b = 3, k<750 | lukerichards | And now for something completely different | 13 | 2019-05-11 23:27 |
Reservations | kar_bon | Riesel Prime Data Collecting (k*2^n-1) | 129 | 2016-09-05 09:23 |
Reservations? | R.D. Silverman | NFS@Home | 15 | 2015-11-29 23:18 |
4-5M Reservations | paulunderwood | 3*2^n-1 Search | 15 | 2008-06-08 03:29 |