Merge pull request #5599 from Abigail/abigail/week-150

Abigail/week 150

2 files changed, 46 insertions, 0 deletions

diff --git a/challenge-150/abigail/lua/ch-1.lua b/challenge-150/abigail/lua/ch-1.lua
new file mode 100644
index 0000000000..ddaa1237c5
--- /dev/null
+++ b/challenge-150/abigail/lua/ch-1.lua
@@ -0,0 +1,19 @@
+#!/opt/local/bin/lua
+
+--
+-- See https://theweeklychallenge.org/blog/perl-weekly-challenge-150
+--
+
+--
+-- Run as: lua ch-1.lua < input-file
+--
+
+local LENGTH = 51
+
+for line in io . lines () do
+    local fib_prev, fib_last = line : match ("(%S+) (%S+)")
+    while fib_last : len () < LENGTH do
+        fib_prev, fib_last = fib_last, fib_prev .. fib_last
+    end
+    print (fib_last : sub (LENGTH, LENGTH))
+end
diff --git a/challenge-150/abigail/lua/ch-2.lua b/challenge-150/abigail/lua/ch-2.lua
new file mode 100644
index 0000000000..f3e4862279
--- /dev/null
+++ b/challenge-150/abigail/lua/ch-2.lua
@@ -0,0 +1,27 @@
+#!/opt/local/bin/lua
+
+--
+-- See https://theweeklychallenge.org/blog/perl-weekly-challenge-150
+--
+
+--
+-- Run as: lua ch-2.lua
+--
+
+local primes = {2, 3, 5, 7, 11, 13, 17, 19}
+local max    = 500
+
+for n = 1, max do
+    local has_square = 0
+    local p
+    for _, p in ipairs (primes) do
+        if n % (p * p) == 0 then
+            has_square = 1
+        end
+    end
+    if has_square == 0 then
+        io . write (n)
+        io . write (" ")
+    end
+end
+io . write ("\n")