Cubic special primes: Difference between revisions
→{{header|Ring}}
(Added Go) |
|||
Line 131:
next
see "prime1 prime2 Gap Cbrt" + nl
for n = 1 to Len(Primes)-1
diff = Primes[n+1] - Primes[n]
if pow(m,3) = diff
cbrt = m
exit
ok
next
see ""+ Primes[n] + " " + Primes[n+1] + " " + diff + " " + cbrt + nl
next
see "Found " + Len(Primes) + " of the smallest primes < 15,000 such that the difference of successive terma are the smallest cubic numbers" + nl
see "done..." + nl
</lang>
{{out}}
<pre>
working...
prime1 prime2 Gap Cbrt
2 3 1 1
3 11 8 2
11 19 8 2
19 83 64 4
83 1811 1728 12
1811 2027 216 6
2027 2243 216 6
2243 2251 8 2
2251 2467 216 6
2467 2531 64 4
2531 2539 8 2
2539 3539 1000 10
3539 3547 8 2
3547 4547 1000 10
4547 5059 512 8
5059 10891 5832 18
10891 12619 1728 12
12619 13619 1000 10
13619 13627 8 2
13627 13691 64 4
13691 13907 216 6
13907 14419 512 8
Found 23 of the smallest primes < 15,000 such that the difference of successive terma are the smallest cubic numbers
done...
| |||