20181218, 13:55  #133  
Banned
"Luigi"
Aug 2002
Team Italia
7^{2}·97 Posts 
Quote:
Where does your 30e9 comes from? 

20181218, 14:35  #134  
"Dylan"
Mar 2017
468_{10} Posts 
Quote:


20181218, 16:36  #135  
Banned
"Luigi"
Aug 2002
Team Italia
11221_{8} Posts 
Quote:
Unfortunately, the ranges have been requested and done in different chunks, not just in chunks of 10 N, and the range search operates on the database of requests. Mark told me many times that I could rework the ranges accordingly: chunks of 10 N for 100 < N < 999 chunks of 100 N for 1000 < N < 9999 chunks of1000 N for 10000 < N < 99999 I objected that it would be a bit tricky, it would not reflect the work of the researchers, and even if I did there would be odd chunks anyway, so he decided to scrape the results and use his own program to get the correct values in correct chunks. Assuming that the range search page is a continuous source of misunderstanding, I could decide in the future to recode his program in PHP (provided is does not become expensive on SQL queries). Sorry for the issue. Luigi Last fiddled with by ET_ on 20181218 at 16:37 

20181218, 18:00  #136 
"Mark"
Apr 2003
Between here and the
5709_{10} Posts 
Luigi and I are on the same page. I wrote my program to help identify gaps, ranges of n and k that were somehow missed by previous searchers. This created two challenges. First, for any given n, what is a reasonable expectation for searching other n above or below that n to the same k. For example, if you have n = 501, should that n be searched to the same k as n = 500? What about n = 502? The answer is "it depends". Second, given a grouping of n, what is a reasonable expectation for searching a range of k for that n? For example, assuming that we grouped 10 n, 500509 as an example, should a searcher reserve a k range of 1e5, 1e8, 1e10, etc? The answer to this is driven more by the speed of programs used to search the range of n and how long it would take a single core to complete the search of the range.
To help me group the n into ranges, I looked at the data to find the gaps. Those gaps along with the patterns of max k per n lead to the recommendations I gave to Luigi. I think that most participants who read mersenneforum have been following them. Hopefully they have made his life easier when it comes to managing reservations and completed ranges. To summarize: Code:
30 <= n < 100, k multiple of 1e14 100 <= n < 500, k multiple of 1e12 500 <= n < 1000, k multiple of 1e11 1000 <= n < 5000, k multiple of 1e9 5000 <= n < 10000, k multiple of 1e8 10000 <= n < 40000, k multiple of 1e6 40000 <= n < 100000, k multiple of 1e4 100000 <= n are not included I have attached source code and lists (generated by that code) to this post. The "groups.txt" file shows the groups of n and the depth to which they have been searched. The "gaps.txt" file shows n where some n for the range have been searched to different k than other n in that range. The "wanted.txt" file shows n where a higher n has been searched to a higher k. BTW, there is one difference between the attached code and the output. The output has details for n < 30. The attached code excludes n < 30. The reason is that ECM factoring has not found any new factors for these Fermat numbers. Statistically it is extremely unlikely that there are any unknown factors for these Fermat numbers that are less than 50 digits in length which is well beyond the ranges already tested using GFN testing software. Last fiddled with by rogue on 20181218 at 18:10 
20181218, 20:37  #137 
"Dylan"
Mar 2017
468_{10} Posts 
Thanks Mark and Luigi for the clarifications. I will instead take n = 250259, k = 71e1275e12 to start with.

20181231, 17:41  #138 
"Dylan"
Mar 2017
2^{2}·3^{2}·13 Posts 

20190109, 19:14  #139 
"Dylan"
Mar 2017
2^{2}·3^{2}·13 Posts 
Taking n = 9200092999, k = 15e416e4.

20190118, 13:09  #140 
"Dylan"
Mar 2017
111010100_{2} Posts 

20190121, 15:04  #141 
"Mark"
Apr 2003
Between here and the
3·11·173 Posts 
Taking n 4600146999 k 100e4120e4.
This range shows up as a "gap" because someone completed a range that ended at 46000 instead of 45999. I see that Serge has a number of reservations dating back to August. With the horsepower available to him, I'm surprised that those ranges are not done. 
20190130, 02:21  #142 
"Dylan"
Mar 2017
2^{2}·3^{2}·13 Posts 
Taking n = 490499, k = 6e127e12.

20190205, 01:30  #143 
"Dylan"
Mar 2017
2^{2}·3^{2}·13 Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Reservations  ET_  Operazione Doppi Mersennes  484  20200323 19:13 
Reservations  kar_bon  Riesel Prime Data Collecting (k*2^n1)  129  20160905 09:23 
Reservations?  R.D. Silverman  NFS@Home  15  20151129 23:18 
Reservations  R.D. Silverman  Cunningham Tables  15  20110304 21:01 
45M Reservations  paulunderwood  3*2^n1 Search  15  20080608 03:29 