20100830, 02:31  #12 
Aug 2006
13533_{8} Posts 
I dislike Macs and certainly wouldn't use one for my main system.
I guess it shouldn't have surprised me that "Mr. Redundancy" 3.14159 would include them in two places. 
20100830, 02:40  #13  
May 2010
Prime hunting commission.
2^{4}·3·5·7 Posts 
Quote:
Quote:
You might as well be arguing that all the only bases that should be used are prime numbers. Well, I'll continue working on the file. I'm up to b = 120. Also: @Will(Mod): Pardon the first few posts. I was a tad too excited. Making files for 76250; 251500; 501750; 7511000; etc. Note to CRG: If you want to keep going with the computing of the first k for whick k * b^{b} is prime: Warning: b = 1000 will be 3000 digits in length. Also, isn't there a Proth program for Linux, anyway? Last fiddled with by 3.14159 on 20100830 at 03:39 

20100830, 05:36  #14 
May 2010
Prime hunting commission.
2^{4}×3×5×7 Posts 
I have completed the file for bases 60 to 250, kranges 1 to 10000.

20100830, 05:38  #15 
May 2010
Prime hunting commission.
2^{4}×3×5×7 Posts 
Bases 251 to 500 will be completed later on.

20100830, 05:57  #16 
Aug 2006
3·1,993 Posts 

20100830, 05:59  #17 
Mar 2006
Germany
2^{4}×3×61 Posts 
Now this cries for an own HP with tables to show and download!
But first of all: A new thread with only 'Database of kbb's"? Nobody will ever figure out, what numbers are colleted here until he read the whole 1100+ posts of the other thread or find the right post! So the first post should contain the type of all these numbers with an example and the boundaries for k and n or restrictions for them! Perhaps any mod cn do this, please! 
20100830, 13:56  #18  
May 2010
Prime hunting commission.
2^{4}×3×5×7 Posts 
Quote:
Quote:
The primes being collected here are of the form k * b^{b} + 1, where b is a positive integer ≥ 60. k is in between 1 and 10000. I have collected these up to where b = 250. I am now working on b = 251 to 500. So: Karsten; Better? Quote:
Last fiddled with by 3.14159 on 20100830 at 13:57 

20100830, 15:46  #19 
May 2010
Prime hunting commission.
2^{4}×3×5×7 Posts 
I am currently up to b = 344. Which means I have found every k * b^{b} + 1 prime for k = 1 to 10k for under 870 digits.
Update: Every prime under 900* digits. What I hope to do is continue until the 10000digit range. Also: @CRG: If you'd like, you can search for the  1 analogues. Last fiddled with by 3.14159 on 20100830 at 15:57 
20100830, 17:29  #20 
"Mark"
Apr 2003
Between here and the
14507_{8} Posts 
If you need to sieve number of the form k*b^n+/1, then MultiSieve can handle that form. It isn't exceptionally fast, but it could save you a lot of time. AFAIK, NewPGen cannot sieve that form.

20100830, 17:33  #21  
May 2010
Prime hunting commission.
2^{4}×3×5×7 Posts 
Quote:
I'm up to b = 405, and I have made a file for b = 60 to 250, and I'm making one for b = 251 to 500. I'm recording for small kvalues. Last fiddled with by 3.14159 on 20100830 at 17:34 

20100830, 17:37  #22  
"Forget I exist"
Jul 2009
Dumbassville
2^{6}×131 Posts 
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
CPU Performance Database  JustinGC  Hardware  3  20120622 03:11 
Database question  Xyzzy  Forum Feedback  0  20120401 15:37 
entire database done up to 2^58  tha  Lone Mersenne Hunters  11  20101017 08:27 
NPLB Database  IronBits  No Prime Left Behind  177  20091010 09:00 
database.zip  HiddenWarrior  Data  1  20040329 03:53 