about summary refs log tree commit diff
path: root/assessments
diff options
context:
space:
mode:
authorWilliam Carroll <wpcarro@gmail.com>2020-12-11T18·52+0000
committerWilliam Carroll <wpcarro@gmail.com>2020-12-11T18·52+0000
commitc23a12746c8192859436392737de1667083e098a (patch)
tree442c96e3762f03b748621aaa8f17324427c779b9 /assessments
parentaa788b128cc34053a3df885f574036b0aa3a5f25 (diff)
Initialize the Semiprimes Service
This is an exciting take-home assignment because I get to write a service in
Elixir!
Diffstat (limited to 'assessments')
-rw-r--r--assessments/semiprimes/README.md30
1 files changed, 30 insertions, 0 deletions
diff --git a/assessments/semiprimes/README.md b/assessments/semiprimes/README.md
new file mode 100644
index 000000000000..3ea04b6b34cc
--- /dev/null
+++ b/assessments/semiprimes/README.md
@@ -0,0 +1,30 @@
+# Semiprimes Service
+
+## Introduction
+
+A **composite** is a number containing at least two prime factors. For example:
+
+```
+15 = 3 × 5
+9 = 3 × 3
+12 = 2 × 2 × 3
+```
+
+There are ten composites below thirty containing precisely two, not necessarily
+distinct, prime factors: `4, 6, 9, 10, 14, 15, 21, 22, 25, 26`. Let’s call such
+numbers *Semiprimes*.
+
+## Task
+
+- Write a module which provides a function to tell whether a given number, `N`,
+  is a semiprime. `N` will be 10^5.
+- Please implement an API (RESTful or GraphQL) to factor a given number into two
+  prime numbers if it’s a semiprime, otherwise, return an error message.
+
+## Stretch Goals
+
+- Handle the invalid inputs.
+- Support batch requests: i.e. users could provide 100 numbers, and the API
+  return the answer for all.
+- Considering this module will be used by a long running service, could you
+  optimize it to give answers faster?