Week 150: Solutions

2 files changed, 44 insertions, 0 deletions

diff --git a/challenge-150/abigail/node/ch-1.js b/challenge-150/abigail/node/ch-1.js
new file mode 100644
index 0000000000..4a716a5c6a
--- /dev/null
+++ b/challenge-150/abigail/node/ch-1.js
@@ -0,0 +1,21 @@
+#!/usr/local/bin/node
+
+//
+// See https://theweeklychallenge.org/blog/perl-weekly-challenge-150
+//
+
+//
+// Run as: node ch-1.js < input-file
+//
+
+  require ('readline')
+. createInterface ({input: process . stdin})   
+. on              ('line', line => {
+    let [fib_prev, fib_last] = line . trim () . split (" ")
+    while (fib_last . length < 51) {
+        let fib_tmp = fib_last
+        fib_last    = fib_prev + fib_last
+        fib_prev    = fib_tmp
+    }
+    console . log (fib_last [50])
+})
diff --git a/challenge-150/abigail/node/ch-2.js b/challenge-150/abigail/node/ch-2.js
new file mode 100644
index 0000000000..1b9e5aac34
--- /dev/null
+++ b/challenge-150/abigail/node/ch-2.js
@@ -0,0 +1,23 @@
+#!/usr/local/bin/node
+
+//
+// See https://theweeklychallenge.org/blog/perl-weekly-challenge-150
+//
+
+//
+// Run as: node ch-2.js
+//
+
+let primes = [2, 3, 5, 7, 11, 13, 17, 19];
+for (let n = 1; n <= 500; n ++) {
+    let has_square = false
+    primes . forEach (p => {
+        if (n % (p * p) == 0) {
+            has_square = true
+        }
+    })
+    if (!has_square) {
+        process . stdout . write (n . toString () + " ")
+    }
+}
+process . stdout . write ("\n")