aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorSimon Proctor <simon.proctor@zpg.co.uk>2019-08-19 09:09:00 +0100
committerSimon Proctor <simon.proctor@zpg.co.uk>2019-08-19 09:09:00 +0100
commit1eed047dc5ae4c1ce670df64d53c427cb7b76fba (patch)
treeeec097d9f3d6fb3a1a223b3ea9fc5890b55ed47e
parent0dc25787d9d42c228565b54b8fc327e676c526d2 (diff)
downloadperlweeklychallenge-club-1eed047dc5ae4c1ce670df64d53c427cb7b76fba.tar.gz
perlweeklychallenge-club-1eed047dc5ae4c1ce670df64d53c427cb7b76fba.tar.bz2
perlweeklychallenge-club-1eed047dc5ae4c1ce670df64d53c427cb7b76fba.zip
Finding 'sexy' primes.
-rw-r--r--challenge-022/simon-proctor/perl6/ch-1.p613
1 files changed, 13 insertions, 0 deletions
diff --git a/challenge-022/simon-proctor/perl6/ch-1.p6 b/challenge-022/simon-proctor/perl6/ch-1.p6
new file mode 100644
index 0000000000..d1539fe771
--- /dev/null
+++ b/challenge-022/simon-proctor/perl6/ch-1.p6
@@ -0,0 +1,13 @@
+#!/usr/bin/env perl6
+
+use v6;
+
+#| Usage notes
+multi sub MAIN ( :h(:$help) ) { say $*USAGE }
+
+#| Calculate the first n paris of "sexy" primes (being two primes seperated by 6)
+multi sub MAIN (
+ UInt $n = 10 #= Number to calculate
+) {
+ .say for (^Inf).hyper.grep( { $_.is-prime && ($_ + 6).is-prime } ).map( { ($_,$_+6).join(",") } )[^$n];
+}