Prime numbers whose neighboring pairs are tetraprimes: Difference between revisions
Content deleted Content added
Added XPL0 example. |
→{{header|Wren}}: More efficient as we need to sort the gaps anyway to find the median. |
||
Line 90:
var gaps = List.filled(tetras.count-1, 0)
for (k in 0...tetras.count-1) gaps[k] = tetras[k+1] - tetras[k]
var
var
var med = Nums.median(gaps)
Fmt.print("Minimum gap between those $,d primes : $,d", c, min)
Fmt.print("
Fmt.print("Maximum gap between those $,d primes : $,d", c, max)
Fmt.print()
|