![]() |
|
|
#12 |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
588710 Posts |
You seem to be finding some good records here.
How large a tuple do you think you will be able to find efficiently? |
|
|
|
|
|
#13 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
9,497 Posts |
Just up to 7-tuplets with this approach (as shown above).
At 8-tuplets, this form becomes too sparse (e.g. k*p#/154+d can be barely used, with d=±4, ±2, 8, 14, 16, 22 and the same on the negative side; not d=±8, ±4, ±2, 14 because this set obviously covers all residues mod 7). The symmetry (and the nice set of ± powers of 2) breaks and more and more primes have to be excluded from the primorial and the efficiency of the form is gone. P.S. I call them "small sets" for fun. I did write to Tony Forbes for his list. |
|
|
|
|
|
#14 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
251916 Posts |
And a (semi-conventional) 5-tuplet, to boot. (This one took a few days to find.)
9039840848561*3299#/35+d, d=-5,-1,1,5,7 (1401 digits) |
|
|
|
|
|
#15 |
|
"(^r'°:.:)^n;e'e"
Nov 2008
;t:.:;^
33×37 Posts |
SB@|°\/
in more human dimensions us from here ... (Twins) 1000037, 1000039 k = 73632 What signify our arrows in the drawing, for calculation? |
|
|
|
|
|
#16 | |
|
Jun 2009
22·32·19 Posts |
Quote:
Found with the help of standard NewPGen (started sieving with gsieve): 1288726869465789*2^34567 -5/-1/+1 |
|
|
|
|
|
|
#17 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
100101000110012 Posts |
Congrats! I've seen it in the top.
Nope, those hacks are still butt ugly - I haven't looked back at them since December. I hacked, I compiled, I ran the code, I found. Never looked back. |
|
|
|
|
|
#18 |
|
Jun 2009
22·32·19 Posts |
That's fine, I was just wondering.
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Sum of reciprocals of prime k-tuplets | mart_r | Math | 10 | 2009-04-05 07:29 |