Jump to content

Prime numbers whose neighboring pairs are tetraprimes: Difference between revisions

m
Line 614:
f_gaps100k = [fol1M[i] - fol1M[i - 1] for i in 2:lastindex(fol1M) if fol1M[i] < 100_000]
 
for (tet, s, s2, tmin, tmed, tmax, t7) in [
pmin100k, pmedian100k, pmax100k = minimum(p_gaps100k), median(p_gaps100k), maximum(p_gaps100k)
(pre100k, "100,000", "preceding", pmin100k, pmedian100k, pmax100k, pre100k_with7),
fmin100k, fmedian100k, fmax100k = minimum(f_gaps100k), median(f_gaps100k), maximum(f_gaps100k)
(fol100k, "100,000", "following", fmin100k, fmedian100k, fmax100k, fol100k_with7),
pmin1M, pmedian1M, pmax1M = minimum(p_gaps1M), median(p_gaps1M), maximum(p_gaps1M)
(pre1M, "1,000,000", "preceding", pmin1M, pmedian1M, pmax1M, pre1M_with7),
fmin1M, fmedian1M, fmax1M = minimum(f_gaps1M), median(f_gaps1M), maximum(f_gaps1M)
(fol1M, "1,000,000", "following", fmin1M, fmedian1M, fmax1M, fol1M_with7),
 
for (tet, s, tmin, tmed, tmax, t7) in [
(pre100k, "100,000", pmin100k, pmedian100k, pmax100k, pre100k_with7),
(fol100k, "100,000", fmin100k, fmedian100k, fmax100k, fol100k_with7),
(pre1M, "1,000,000", pmin1M, pmedian1M, pmax1M, pre1M_with7),
(fol1M, "1,000,000", fmin1M, fmedian1M, fmax1M, fol1M_with7),
]
print("Found $(length(tet)) primes under $s whose preceding$s2 neighboring pair are tetraprimes")
if s == "100,000"
println(":")
Line 648 ⟶ 643:
Of those primes, 31 have a neighboring pair one of whose factors is 7.
 
Found 46 primes under 100,000 whose precedingfollowing neighboring pair are tetraprimes:
8293 16553 17389 18289 22153 26893 29209 33409 35509 36293
39233 39829 40493 41809 45589 48109 58393 59629 59753 59981
Line 661 ⟶ 656:
Of those primes, 5176 have a neighboring pair one of whose factors is 7.
 
Found 10551 primes under 1,000,000 whose precedingfollowing neighboring pair are tetraprimes.
Minimum, median, and maximum gaps between those primes: 4 660.0 10284
Of those primes, 5069 have a neighboring pair one of whose factors is 7.
4,105

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.