Strange unique prime triplets: Difference between revisions
Content deleted Content added
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;
[]BOOL
# we need to find the strange unique prime triplets below 1000 #
INT s count := 0, c30 := 0;
|