Rosetta Code

Strange unique prime triplets: Difference between revisions

Page Discussion

Strange unique prime triplets (view source)

Revision as of 15:26, 29 August 2021

266 bytes removed ,  2 years ago
→‎{{header|ALGOL 68}}: Use ALGOL 68-primes
(Added Fōrmulæ solution)
(→‎{{header|ALGOL 68}}: Use ALGOL 68-primes)
Line 89:
=={{header|ALGOL 68}}==
{{Trans|Algol W}} which is based on {{Trans|Wren}}
{{libheader|ALGOL 68-primes}}
<lang algol68>BEGIN # find some strange unique primes - triplets of primes n, m, p #
# where n + m + p is also prime and n =/= m =/= p #
Line 94 ⟶ 95:
# so the maximum triplet sum could be roughly 3000 #
INT max number = 1000;
INT# maxsieve primethe primes =to maxthe numbermaximum *reuired prime 3;#
#PR sieve theread "primes.incl.a68" to max prime #PR
[]BOOL 1prime := PRIMESIEVE ( max primenumber ]BOOL* prime3 );
prime[ 1 ] := FALSE; prime[ 2 ] := TRUE;
FOR i FROM 3 BY 2 TO UPB prime DO prime[ i ] := TRUE OD;
FOR i FROM 4 BY 2 TO UPB prime DO prime[ i ] := FALSE OD;
FOR i FROM 3 BY 2 TO ENTIER sqrt( max prime ) DO
IF prime[ i ] THEN FOR s FROM i * i BY i + i TO UPB prime DO prime[ s ] := FALSE OD FI
OD;
# we need to find the strange unique prime triplets below 1000 #
INT s count := 0, c30 := 0;
Tigerofdarkness
3,044

edits

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