Sexy primes: Difference between revisions

Content added Content deleted
Line 1,928: Line 1,928:


see "Sexy prime pairs under 100:" + nl + nl
see "Sexy prime pairs under 100:" + nl + nl
for n = 1 to len(primes)
for n = 1 to len(primes)-1
for m = n + 1 to len(primes)-1
for m = n + 1 to len(primes)
if primes[m] - primes[n] = 6
if primes[m] - primes[n] = 6
see "(" + primes[n] + " " + primes[m] + ")" + nl
see "(" + primes[n] + " " + primes[m] + ")" + nl
Line 1,938: Line 1,938:


see "Sexy prime triplets under 100:" + nl +nl
see "Sexy prime triplets under 100:" + nl +nl
for n = 1 to len(primes)
for n = 1 to len(primes)-2
for m = n + 1 to len(primes)-1
for m = n + 1 to len(primes)-1
for x = m + 1 to len(primes)-2
for x = m + 1 to len(primes)
bool1 = (primes[m] - primes[n] = 6)
bool1 = (primes[m] - primes[n] = 6)
bool2 = (primes[x] - primes[m] = 6)
bool2 = (primes[x] - primes[m] = 6)
Line 1,953: Line 1,953:


see "Sexy prime quadruplets under 100:" + nl + nl
see "Sexy prime quadruplets under 100:" + nl + nl
for n = 1 to len(primes)
for n = 1 to len(primes)-3
for m = n + 1 to len(primes)-1
for m = n + 1 to len(primes)-2
for x = m + 1 to len(primes)-2
for x = m + 1 to len(primes)-1
for y = m + 1 to len(primes)-3
for y = m + 1 to len(primes)
bool1 = (primes[m] - primes[n] = 6)
bool1 = (primes[m] - primes[n] = 6)
bool2 = (primes[x] - primes[m] = 6)
bool2 = (primes[x] - primes[m] = 6)
Line 1,971: Line 1,971:


see "Sexy prime quintuplets under 100:" + nl + nl
see "Sexy prime quintuplets under 100:" + nl + nl
for n = 1 to len(primes)
for n = 1 to len(primes)-4
for m = n + 1 to len(primes)-1
for m = n + 1 to len(primes)-3
for x = m + 1 to len(primes)-2
for x = m + 1 to len(primes)-2
for y = m + 1 to len(primes)-3
for y = m + 1 to len(primes)-1
for z = y + 1 to len(primes)-4
for z = y + 1 to len(primes)
bool1 = (primes[m] - primes[n] = 6)
bool1 = (primes[m] - primes[n] = 6)
bool2 = (primes[x] - primes[m] = 6)
bool2 = (primes[x] - primes[m] = 6)
Retrieved from "https://rosettacode.org/wiki/Sexy_primes"