![]() |
|
|
#12 |
|
Aug 2006
3·1,993 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. |
|
|
|
|
|
#13 | ||
|
May 2010
Prime hunting commission.
168010 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 76-250; 251-500; 501-750; 751-1000; etc. Note to CRG: If you want to keep going with the computing of the first k for whick k * bb 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 2010-08-30 at 03:39 |
||
|
|
|
|
|
#14 |
|
May 2010
Prime hunting commission.
110100100002 Posts |
I have completed the file for bases 60 to 250, k-ranges 1 to 10000.
|
|
|
|
|
|
#15 |
|
May 2010
Prime hunting commission.
24×3×5×7 Posts |
Bases 251 to 500 will be completed later on.
|
|
|
|
|
|
#16 |
|
Aug 2006
10111010110112 Posts |
|
|
|
|
|
|
#17 |
|
Mar 2006
Germany
290410 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 k-b-b'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! |
|
|
|
|
|
#18 | |||
|
May 2010
Prime hunting commission.
24×3×5×7 Posts |
Quote:
Quote:
The primes being collected here are of the form k * bb + 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 2010-08-30 at 13:57 |
|||
|
|
|
|
|
#19 |
|
May 2010
Prime hunting commission.
24×3×5×7 Posts |
I am currently up to b = 344. Which means I have found every k * bb + 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 10000-digit range. Also: @CRG: If you'd like, you can search for the - 1 analogues. Last fiddled with by 3.14159 on 2010-08-30 at 15:57 |
|
|
|
|
|
#20 |
|
"Mark"
Apr 2003
Between here and the
11×577 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.
|
|
|
|
|
|
#21 | |
|
May 2010
Prime hunting commission.
24·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 k-values. Last fiddled with by 3.14159 on 2010-08-30 at 17:34 |
|
|
|
|
|
|
#22 | |
|
"Forget I exist"
Jul 2009
Dumbassville
26·131 Posts |
Quote:
|
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| CPU Performance Database | JustinGC | Hardware | 3 | 2012-06-22 03:11 |
| Database question | Xyzzy | Forum Feedback | 0 | 2012-04-01 15:37 |
| entire database done up to 2^58 | tha | Lone Mersenne Hunters | 11 | 2010-10-17 08:27 |
| NPLB Database | IronBits | No Prime Left Behind | 177 | 2009-10-10 09:00 |
| database.zip | HiddenWarrior | Data | 1 | 2004-03-29 03:53 |