Week 150: Solutions

2 files changed, 44 insertions, 0 deletions

diff --git a/challenge-150/abigail/awk/ch-1.awk b/challenge-150/abigail/awk/ch-1.awk
new file mode 100644
index 0000000000..9ec6a35d22
--- /dev/null
+++ b/challenge-150/abigail/awk/ch-1.awk
@@ -0,0 +1,21 @@
+#!/usr/bin/awk
+
+#
+# See https://theweeklychallenge.org/blog/perl-weekly-challenge-150
+#
+
+#
+# Run as: awk -f ch-1.awk < input-file
+#
+
+{
+    fib_prev = $1
+    fib_last = $2
+    LENGTH = 51
+    while (length (fib_last) < LENGTH) {
+        fib_tmp  = fib_last
+        fib_last = fib_prev fib_last
+        fib_prev = fib_tmp
+    }
+    print substr (fib_last, LENGTH, 1)
+}
diff --git a/challenge-150/abigail/awk/ch-2.awk b/challenge-150/abigail/awk/ch-2.awk
new file mode 100644
index 0000000000..a3d1583f40
--- /dev/null
+++ b/challenge-150/abigail/awk/ch-2.awk
@@ -0,0 +1,23 @@
+#!/usr/bin/awk
+
+#
+# See https://theweeklychallenge.org/blog/perl-weekly-challenge-150
+#
+
+#
+# Run as: awk -f ch-2.awk
+#
+
+BEGIN {
+    split ("2 3 5 7 11 13 17 19", primes)
+    for (n = 1; n <= 500; n ++) {
+        s = 1
+        for (p = 1; p <= 8 && s; p ++) {
+            s *= n % (primes [p] * primes [p])
+        }
+        if (s) {
+            printf "%d ", n
+        }
+    }
+    printf "\n"
+}