13 files changed, 148 insertions, 8 deletions
diff --git a/README.md b/README.md
index 3944068..0fcbc53 100644
--- a/README.md
+++ b/README.md
@@ -16,7 +16,8 @@ For a submission to the upcoming "Reclaim your space" exhibition at [Hatch Art G
 <!-- - `imperitive-church` imperitive implementation in the lambda calculus -->
 
 ### [`ionathanch`](https://github.com/ionathanch)
-- [`agda`](./entries/ionathanch/agda/Fib.agda)
+- [`agda`](./entries/ionathanch/Fib.agda)
+- [`fortran`](./entries/ionathanch/fib.f90)
 
 ### [`funemy`](https://github.com/funemy)
 - [`agda`](./entries/funemy/agda/fib1.agda)
@@ -31,6 +32,12 @@ For a submission to the upcoming "Reclaim your space" exhibition at [Hatch Art G
 ### [`Metroxe`](https://github.com/Metroxe)
 - [`html`](./entries/Metroxe/index.html)
 
+### [`nritschel`](https://github.com/nritschel)
+- [`fib-java`](./entries/nritschel/fib-java/src)
+
+### [`rtholmes`](https://github.com/rtholmes)
+- [`stack-overflow`](./entries/rtholmes/Fibonacci%20series%20in%20JavaScript%20-%20Stack%20Overflow.webloc)
+
 ### [`shayanh`](https://github.com/shayanh)
 - [`matrix`](./entries/shayanh/matrix.go)
 
diff --git a/entries/funemy/z3/z3fib.sh b/entries/funemy/z3/z3fib.sh
index 9faa228..07ab418 100755
--- a/entries/funemy/z3/z3fib.sh
+++ b/entries/funemy/z3/z3fib.sh
@@ -1,7 +1,7 @@
 #!/bin/bash
 
-# Instruction:
-#  1. having z3 installed and under you $PATH
+# Instructions:
+#  1. having z3 installed and put under your $PATH
 #  2. making sure z3fib.sh is executable, by `chmod +x z3fib.sh`
 #  3. running as `./z3fib.sh [length of the fib sequence]`
 #  4. having fun :)
@@ -14,6 +14,11 @@ else
     touch fib.smt2
 fi
 
+if [ "$1" -lt "0" ]; then
+  echo "Argument must be larger than 0."
+  exit 1
+fi
+
 for i in $(seq 0 $1);
 do
   echo "(declare-const x$i Int)" >> fib.smt2
@@ -30,12 +35,16 @@ do
 done
 
 echo "    (= x0 0)" >> fib.smt2
-echo "    (= x1 1)" >> fib.smt2
+if [ "$1" -ge "1" ]; then
+  echo "    (= x1 1)" >> fib.smt2
+fi
 
-for i in $(seq 2 $1);
-do
-  echo "    (= x$i (+ x$(($i - 2)) x$(($i - 1))))" >> fib.smt2
-done
+if [ "$1" -ge "2" ]; then
+  for i in $(seq 2 $1);
+  do
+    echo "    (= x$i (+ x$(($i - 2)) x$(($i - 1))))" >> fib.smt2
+  done
+fi
 
 echo "  )" >> fib.smt2
 echo ")" >> fib.smt2
diff --git a/entries/ionathanch/agda/Fib.agda b/entries/ionathanch/Fib.agda
index a12b0a5..a12b0a5 100644
--- a/entries/ionathanch/agda/Fib.agda
+++ b/entries/ionathanch/Fib.agda
diff --git a/entries/ionathanch/fib.f90 b/entries/ionathanch/fib.f90
new file mode 100644
index 0000000..3cf1850
--- /dev/null
+++ b/entries/ionathanch/fib.f90
@@ -0,0 +1,21 @@
+PROGRAM main
+  ! The 93rd Fibonacci number is the largest that fits in 64 bits anyway
+  CHARACTER(3) :: kth
+  INTEGER :: k
+  CALL get_command_argument(1, kth)
+  READ(kth, *) k
+  WRITE(*, *) fib(k)
+CONTAINS
+
+PURE RECURSIVE INTEGER*8 FUNCTION fib(k) RESULT(n)
+  INTEGER, INTENT (IN) :: k
+  IF (k == 0) THEN
+    n = 0
+  ELSE IF (k == 1) THEN
+    n = 1
+  ELSE
+    n = fib(k - 1) + fib(k - 2)
+  END IF
+END FUNCTION fib
+
+END PROGRAM
diff --git a/entries/nritschel/fib-java/fib.iml b/entries/nritschel/fib-java/fib.iml
new file mode 100644
index 0000000..815e958
--- /dev/null
+++ b/entries/nritschel/fib-java/fib.iml
@@ -0,0 +1,13 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+    <orderEntry type="module-library">
+    </orderEntry>
+  </component>
+</module>
+\ No newline at end of file
diff --git a/entries/nritschel/fib-java/src/CachedFibonacciNumberFactory.java b/entries/nritschel/fib-java/src/CachedFibonacciNumberFactory.java
new file mode 100644
index 0000000..5c404e8
--- /dev/null
+++ b/entries/nritschel/fib-java/src/CachedFibonacciNumberFactory.java
@@ -0,0 +1,13 @@
+import java.util.HashMap;
+
+public class CachedFibonacciNumberFactory implements FibonacciNumberFactory {
+    private final HashMap<Integer, FibonacciNumber> cachedNumbers = new HashMap<>();
+
+    @Override
+    public FibonacciNumber getFibonacciNumber(int num) {
+        if (!cachedNumbers.containsKey(num)) {
+            cachedNumbers.put(num, new FibonacciNumber(num));
+        }
+        return cachedNumbers.get(num);
+    }
+}
diff --git a/entries/nritschel/fib-java/src/FibonacciCalculator.java b/entries/nritschel/fib-java/src/FibonacciCalculator.java
new file mode 100644
index 0000000..8806c20
--- /dev/null
+++ b/entries/nritschel/fib-java/src/FibonacciCalculator.java
@@ -0,0 +1,3 @@
+public interface FibonacciCalculator {
+    public int calculateFibonacci(FibonacciNumber fib);
+}
diff --git a/entries/nritschel/fib-java/src/FibonacciCalculatorImpl.java b/entries/nritschel/fib-java/src/FibonacciCalculatorImpl.java
new file mode 100644
index 0000000..7bb5ee9
--- /dev/null
+++ b/entries/nritschel/fib-java/src/FibonacciCalculatorImpl.java
@@ -0,0 +1,17 @@
+public class FibonacciCalculatorImpl implements FibonacciCalculator {
+    private final FibonacciNumberFactory factory;
+
+    public FibonacciCalculatorImpl(FibonacciNumberFactory factory) {
+        this.factory = factory;
+    }
+
+    @Override
+    public int calculateFibonacci(FibonacciNumber fib) {
+        if (fib.getNumber() <= 2) {
+            return 1;
+        }
+        else {
+            return factory.getFibonacciNumber(fib.getNumber() - 1).calculate(this) + factory.getFibonacciNumber(fib.getNumber() - 2).calculate(this);
+        }
+    }
+}
diff --git a/entries/nritschel/fib-java/src/FibonacciNumber.java b/entries/nritschel/fib-java/src/FibonacciNumber.java
new file mode 100644
index 0000000..fc9381f
--- /dev/null
+++ b/entries/nritschel/fib-java/src/FibonacciNumber.java
@@ -0,0 +1,19 @@
+public class FibonacciNumber {
+    private final int number;
+    private Integer result;
+
+    public FibonacciNumber(int number) {
+        this.number = number;
+    }
+
+    public int getNumber() {
+        return number;
+    }
+
+    public int calculate(FibonacciCalculator calculator) {
+        if (result == null) {
+            result = calculator.calculateFibonacci(this);
+        }
+        return result;
+    }
+}
diff --git a/entries/nritschel/fib-java/src/FibonacciNumberFactory.java b/entries/nritschel/fib-java/src/FibonacciNumberFactory.java
new file mode 100644
index 0000000..42ef6c2
--- /dev/null
+++ b/entries/nritschel/fib-java/src/FibonacciNumberFactory.java
@@ -0,0 +1,3 @@
+public interface FibonacciNumberFactory {
+    public FibonacciNumber getFibonacciNumber(int num);
+}
diff --git a/entries/nritschel/fib-java/src/Main.java b/entries/nritschel/fib-java/src/Main.java
new file mode 100644
index 0000000..8ae46f1
--- /dev/null
+++ b/entries/nritschel/fib-java/src/Main.java
@@ -0,0 +1,21 @@
+public class Main {
+    public static void main(String[] args) {
+        if (args.length < 1) {
+            System.out.println("""
+                    Please provide:
+                    1. fibonacci number to compute, and
+                    2. (optional) the calculation method (naive or cached).""");
+        }
+        else {
+            FibonacciNumberFactory factory;
+            if (args.length >= 2 && args[1].equals("naive")) {
+                factory = new NaiveFibonacciNumberFactory();
+            }
+            else {
+                factory = new CachedFibonacciNumberFactory();
+            }
+            FibonacciCalculator calculator = new FibonacciCalculatorImpl(factory);
+            System.out.println(factory.getFibonacciNumber(Integer.parseInt(args[0])).calculate(calculator));
+        }
+    }
+}
diff --git a/entries/nritschel/fib-java/src/NaiveFibonacciNumberFactory.java b/entries/nritschel/fib-java/src/NaiveFibonacciNumberFactory.java
new file mode 100644
index 0000000..5185a8b
--- /dev/null
+++ b/entries/nritschel/fib-java/src/NaiveFibonacciNumberFactory.java
@@ -0,0 +1,6 @@
+public class NaiveFibonacciNumberFactory implements FibonacciNumberFactory {
+    @Override
+    public FibonacciNumber getFibonacciNumber(int num) {
+        return new FibonacciNumber(num);
+    }
+}
diff --git a/entries/rtholmes/Fibonacci series in JavaScript - Stack Overflow.webloc b/entries/rtholmes/Fibonacci series in JavaScript - Stack Overflow.webloc
new file mode 100644
index 0000000..939529d
--- /dev/null
+++ b/entries/rtholmes/Fibonacci series in JavaScript - Stack Overflow.webloc
@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+<dict>
+	<key>URL</key>
+	<string>https://stackoverflow.com/a/55764043</string>
+</dict>
+</plist>