20180219, 15:41  #166 
Mar 2006
Germany
17×167 Posts 
CK238 tested to n=10k
Primes: Code:
(1) 1, 2, 7, 68, 2345, 4783, 5425 (+1) 1, 5, 114, 137, 213, 270, 5796, 6798 
20180219, 18:00  #167 
"Dylan"
Mar 2017
2·3·83 Posts 
Base 500 has been searched to n = 10k. The following primes were found:
Code:
(500^4+1)^22 (500^5+1)^22 (500^11+1)^22 (500^9811)^22 (500^2195+1)^22 
20180219, 18:16  #168  
May 2007
Kansas; USA
5^{2}×11×37 Posts 
Quote:
I am in the process of requesting admin access from Mark for things of this nature. Once I have that access I will edit the first post of the reservations thread in this forum to show the applicable sieve files. If you know of any others besides those two posts let me know. At this point I would rather not add a column to the status web page for such things. If at some point the project becomes much bigger with a lot of sieve files available then I feel like we could add a column. 

20180221, 10:38  #169 
Mar 2006
Germany
17×167 Posts 
Admins work ist hard and timeconsuming, especially if you have to check results. So I understand not to show the "power of" bases with their values like in the tables of Wikipedia:
Every new find in for example base 2 you have to update base 4, 8, 16, 32, 64, ... So I've invested some time to upgrade my scripts to do this automatically. New:  all values from "power of" bases will generated from the 'ground base'  search limits without delimiter "," in datafile (because calculating the correct limit for "power of" base)  condensed data ASCIIfile contains date of creation now  for "power of" bases the "ground base" is shown under "base" in brackets  search limit for "power of" bases calculated from "ground base" limit Example: Data file contains: Code:
#32# power of 2 The generated table for the HTMLpage looks like this: Code:
32 150000 (1) 2, 3, 5, 11, 35, 63, 87, 37116, 130698 (2)  (+1) 1, 3, 13, 36, 111, 136, 160, 214, 330, 1273, 7407, 20487, 21276, 22123, 75210 Code:
32 150000 (1) 2, 3, 5, 11, 35, 63, 87, 37116, 130698 (+1) 1, 3, 13, 36, 111, 136, 160, 214, 330, 1273, 7407, 20487, 21276, 22123, 75210 So now there's no reason not to show the values for the "power of" bases, too. Inserting columns for sieve files later can be done also easy here with such script. Idea: a marker if a sieve file exists and the base number can be turned into a link with the destination of the file. Last fiddled with by kar_bon on 20180221 at 10:42 
20180221, 14:37  #170  
Romulan Interpreter
Jun 2011
Thailand
5×11×157 Posts 
Quote:
(2018^2+1)^22 (2018^18001)^22 (2018^3143+1)^22 (2018^37201)^22 All the others below n=27k (and a bit higher) are for sure composite. Releasing the base. (do you need the factors file and/or residues? I kept all factors over 1G and all residues over n=10k) 

20180221, 17:43  #171  
May 2007
Kansas; USA
5^{2}×11×37 Posts 
Quote:
1. The data is simply redundant. The same primes are listed multiple times. 2. What if someone wants to reserve base 256? How do we show that reservation for base 2 or 4 or 8 etc? That only n==(0 mod 8) or (0 mod 4) or (0 mod 2) etc. are being tested? Then there are gaps in the testing ranges, which is overly complex. What if they reserve base 128? How do we show that reservation for base 32? That only n==(5 mod 7) are being tested? It would quickly become ridiculous. #2 is probably the big reason that Mark concluded the same thing. It creates problems because only part of the root bases are being tested. I am trying to maintain the spirit of the project in that regard. CRUS must list the same primes in different bases (which is a hassle but necessary) because the conjectures are different for power bases but that is not applicable here. If the OEIS or WIKI want to show redundant primes/sequences then that is their business. But we will not do it here. Please respect our wishes and quit pushing this issue. Thank you. Last fiddled with by gd_barnes on 20180221 at 17:45 

20180221, 20:13  #172  
May 2007
Kansas; USA
5^{2}·11·37 Posts 
Quote:
Thanks for the info. 

20180221, 22:44  #173 
May 2007
Kansas; USA
5^{2}·11·37 Posts 
I have added links to Wikipedia about these searches/primes in the first post of this thread. If you find a prime for a base <= 50 you can feel free to edit the Wiki to add the prime. If you don't care to I will add it.

20180222, 09:09  #174  
Mar 2006
Germany
17×167 Posts 
Quote:
To get the precise values edit line 55 in the awkscript from "limit=lim[power_of]/cnt" to "limit=int(lim[power_of]/cnt)". To Gary: Reason 1: I agree, that (2^1855801)^22 and (32^37116^)^22 are identical, but the values of n for primes for base 32 and base 2 are different: only the nvalues == (0 mod 5) from base 2 are nvalues (divided by 5) for base 32, so they are not the same! Reason 2: You contradict yourself! On your page there's the term "Reservations will not be accepted for them." (meant are the powerof bases) and all powerof bases are marked. So if you satisfy your own restriction, there's no problem with testing gaps. Your reason 2 is senseless here. On the other hand: If someone is not aware of your page but is searching for base 32 and find a prime at n~150k (this will be a Top5000 entry worth), you'll not accept this find because you got no reservation for base 32 (which you will not accept) nor base 2? Nor you'll not show this find because you got gaps in the search limits? Think about this again. I've never suggested to search the powerof bases but reduce the work for admins to show the nvalues for those bases, too. Now there's no extra byte to edit in powerof bases for a new find in base 2 or 6 but for all higher bases a new entry will be done automatically if needed. 

20180222, 14:40  #175  
"Mark"
Apr 2003
Between here and the
2·3^{2}·5^{2}·13 Posts 
Quote:
Is there any real value to show all base 2 primes as base 4 primes? If someone is searching for this form, but is not aware of this project, then that would be unfortunate, but there is no way for us to know what n they tested and how they decided which n to test for any base. If they used cksieve,then they are clearly aware of this project and finding primes for any bases would be akin to poaching. 

20180222, 20:36  #176  
May 2007
Kansas; USA
10175_{10} Posts 
Quote:
As for your reason 2: We attempt to avoid gaps for the nvalues in k's searched at CRUS and even the folks at RPS attempt to avoid them as best they can. But both projects could potentially have gaps in kvalues searched. They come up at both CRUS (see S3 right now) and RPS. In the spirit of RPS, it encourages people to search whatever kvalues they want and discourages people from leaving gaps in nvalues for specific k's, especially at top5000 range. To apply that logic to this project, the bases here are logically similar to the kvalues at the above 2 projects. We do not ask that people search the bases contiguously. They are free to search whatever base they want just like the kvalues at RPS and to a lesser extent at CRUS. But we strongly discourage people from leaving gaps in nranges for specific bases. So as for me contradicting myself. Per the above reasoning; not at all. The power bases that we don't take reservations are not "gaps" or "holes" in the bases. They've already been searched by the root bases. We just choose not to show them on the pages so as to not encourage searches on them. To allow reservations on the power bases leaves nvalue holes in the root bases. People are welcome to do as they please. RPS had the problem for quite a while with a big searcher searching much higher nranges than their current search depth for small k's such as k=5. Could we have the problem with someone deciding to, say, search base 4 for n=500K1M? Sure. But like Mark said they would have to use cksieve to do so and they would effectively be poaching our project. 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Carol / Kynea Coordinated Search  Reservations  rogue  And now for something completely different  257  20200620 03:13 
Distribution of Mersenne primes before and after couples of primes found  emily  Math  34  20170716 18:44 
Carol / Kynea search (Nearpower primes)  rogue  And now for something completely different  37  20160618 17:58 
a 18+ Christmas carol  science_man_88  Lounge  10  20101213 23:26 
possible primes (real primes & poss.prime products)  troels munkner  Miscellaneous Math  4  20060602 08:35 