Define Server.semiprime

- Clear the boilerplate that `mix` generated
- Consume `Math.factor` to test which inputs are semiprimes
- Cache all inputs that are semiprimes as soon as we discover that they are
- semiprimes

I considered a couple things related to the Cache:
- Could save space by storing all semiprime factors in a tree. This would make
  the lookups more expensive. Also because the tree's depth would never exceed
  two (because all semiprimes only have two factors), the tree would be quite
  broad, and we may not be saving enough space for the trade to be worthwhile. I
  might be wrong about that though.
- We could consider pre-computing all semiprimes when we start the app, but
  without running some tests firsts, I'm not sure whether or not it's worth the
  trouble.

1 files changed, 22 insertions, 7 deletions

diff --git a/assessments/semiprimes/server/lib/server.ex b/assessments/semiprimes/server/lib/server.ex
index 7240fc3426f0..c4088fb20ab5 100644
--- a/assessments/semiprimes/server/lib/server.ex
+++ b/assessments/semiprimes/server/lib/server.ex
@@ -4,15 +4,30 @@ defmodule Server do
   """
 
   @doc """
-  Hello world.
+  If `n` contains exactly two prime factors, return those prime factors;
+  otherwise, return nothing.
+  """
+  def semiprime(n) do
+    case Cache.get(n) do
+      nil ->
+        case do_semiprime(n) do
+          nil ->
+            nil
 
-  ## Examples
+          res ->
+            Cache.put(n, res)
+            res
+        end
 
-      iex> Server.hello()
-      :world
+      hit ->
+        hit
+    end
+  end
 
-  """
-  def hello do
-    :world
+  defp do_semiprime(n) do
+    case Math.factor(n) do
+      [_, _] = res -> res
+      _ -> nil
+    end
   end
 end