Strange unique prime triplets: Difference between revisions
Content added Content deleted
(Realize in F#) |
(added Raku programming solution) |
||
Line 938: | Line 938: | ||
If n, m, p < 1_000 finds 241_580</pre> |
If n, m, p < 1_000 finds 241_580</pre> |
||
=={{header|Raku}}== |
|||
(formerly Perl 6) |
|||
<lang perl6># 20210312 Raku programming solution |
|||
for 30, 1000 -> \k { |
|||
given (2..k).grep(*.is-prime).combinations(3).grep(*.sum.is-prime) { |
|||
say "Found ", +$_, " strange unique prime triplets up to ", k |
|||
} |
|||
}</lang> |
|||
{{out}} |
|||
<pre> |
|||
Found 42 strange unique prime triplets up to 30 |
|||
Found 241580 strange unique prime triplets up to 1000 |
|||
</pre> |
|||
=={{header|REXX}}== |
=={{header|REXX}}== |