Rosetta Code

Double Twin Primes: Difference between revisions

Page Discussion

Double Twin Primes (view source)

Revision as of 15:10, 25 March 2023

134 bytes removed ,  1 year ago
→‎{{header|Ring}}
Line 483:
=={{header|Ring}}==
<syntaxhighlight lang="ring">
see "worksworking..." + nl
primesP = []
 
limit = 1000
for n =1 to limit
if isPrimeisP(n)
add(primesP,n)
ok
next
lenPrimeslenP = len(primesP)-3
for m = 1 to lenPrimeslenP
if isPrimeisP(primesP[m]) andAND isPrimeisP(primesP[m+1]) andAND isP(P[m+2]) AND isP(P[m+3])
isPrimeif (primesP[m+1] - P[m] = 2) AND (P[m+2] - P[m+1] = 4) andAND isPrime(primesP[m+3] - P[m+2] = 2)
if (primes[m+1] - primes[m]see =" 2)" and+ (primesP[m]+2] -" " primes+ P[m+1] =+ 4)" and" +
(primesP[m+32] -+ " " + primesP[m+23] =+ 2)nl
see " " + primes[m]+ " " + primes[m+1] + " " +
primes[m+2] + " " + primes[m+3] + nl
ok
ok
next
 
see "done..." + nl
 
func isPrimeisP num
if (num <= 1) return 0 ok
if (num % 2 = 0 andAND num != 2) return 0 ok
for i = 3 to floor(num / 2) -1 step 2
if (num % i = 0) return 0 ok
next
return 1
</syntaxhighlight>
{{out}}
CalmoSoft
2,468

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/339334"