[QUOTE=rogue;434332]Anyone know of a good place that I can host some web pages for free and not have to deal with ads?[/QUOTE]
You could make an additional page (or pages) at prothsearch.net, maybe? 
[QUOTE=rogue;434332]Did you generate a list of primes for the bases? If so, I will likely need to offload the list elsewhere. Anyone know of a good place that I can host some web pages for free and not have to deal with ads?[/QUOTE]
If interested, I can provide you with a subdomain from one of my domains. I have 19.lc registered. Choose a subdomain as short as you would like and I will set it up. Notes: * I can not guarantee a delivery time * I can not guarantee duration of service So if interested please let me know and make sure you have backups. 
Thanks for your suggestions. MIke (Xyzzy) has offered me space here at mersenneforum, which is the best of all worlds. I had considered prothsearch, but I don't own the domain and with Ray being gone and Wilfred getting older, I don't know how much longer that domain will be around. Also, most of the work is being done by PrimeGrid, so I have been considering locking users from making reservations.

hi,
here are the results for carol / kynea b=66, n=1000 to 30000 (66^1751+1)^22 (66^19021)^22 (66^9832+1)^22 (66^28522+1)^22 b=68, n=1000 to 30000 (68^22721)^22 (68^26341)^22 (68^2960+1)^22 (68^3014+1)^22 (68^165221)^22 
For b=26, no new primes through n=50k. Continuing on to n=100k.

For b=688, [URL="http://factordb.com/index.php?id=1100000000839008688"](688^10160+1)^22[/URL] is prime!
For b<=2000, only b=640 and b=1656 remain without known primes. I reserve b=1656 to n<=20000 and release b=688 at n=11000. 
top5000
Congrats Serge for finding the near square prime [URL="http://primes.utm.edu/primes/page.php?id=121680"](178^87525  1)^2  2[/URL] with 393937 decimal digits! :smile:

[QUOTE=paulunderwood;434582]Congrats Serge for finding the near square prime [URL="http://primes.utm.edu/primes/page.php?id=121680"](178^87525  1)^2  2[/URL] with 393937 decimal digits! :smile:[/QUOTE]
I was wondering. Chris Caldwell's page sent an automated email for cksieve as a program and I wasn't the one to do it. Thanks Serge and congrats. 
Sometime last week I've thought about attacking a recordable (Top5000) CK prime.
I've sieved b=10, 20, 30, 40 far enough, but altogether they didn't have enough sub1hour candidates after sieve to warrant a success (After a certain size candidates start taking more than an hour each, and then quickly 1.5 then 2 hours.) So to bridge the path to certain success, I additionally sieved 102<=b<=202 (but not powers) to 1e11  for a small slice just above 389K decimal digits. Then for technical reasons I chose only 36 thickest bases and sieved them up to 2e12. Then I merged all files and sorted by size and started ~ a hundred PFGW instances. This morning a prime popped up for b=178. I will test through the weekend, then stop, and will post all tested ranges explicitly; they can be added to control tables in square brackets as some Proth and Riesel tables on certain sites are recorded. 
And now, a Kynea prime for b=30, to make a nice pair.
(30[SUP]157950[/SUP] + 1)[SUP]2[/SUP]  2 [URL="http://primes.utm.edu/primes/page.php?id=121686"]is prime[/URL] 
Congrats :banana:

All times are UTC. The time now is 06:47. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2020, Jelsoft Enterprises Ltd.