From 730eb94c9c960b1db8f9602436244c8e7cf6be74 Mon Sep 17 00:00:00 2001
From: Jaime <42359730+bracteatus@users.noreply.github.com>
Date: Fri, 14 Jun 2019 10:52:51 -0600
Subject: Update README

---
 challenge-012/jaime/README | 15 +++++++++++++++
 1 file changed, 15 insertions(+)

diff --git a/challenge-012/jaime/README b/challenge-012/jaime/README
index 1f436468fe..6b98f9b732 100644
--- a/challenge-012/jaime/README
+++ b/challenge-012/jaime/README
@@ -6,6 +6,10 @@ The numbers formed by adding one to the products of the smallest
 primes are called the Euclid Numbers (see wiki). Write a script that
 finds the smallest Euclid Number that is not prime.
 
+## Solution
+
+Calculate the product of prime numbers and check if each successor is a prime.
+
 # Challenge #2
 
 Write a script that finds the common directory path, given a
@@ -22,6 +26,17 @@ following paths are supplied.
 and the path separator is `/`. Your script should return `/a/b` as common
 directory path.
 
+## Solution
+
+```
+perl -- ch-2.pl <*delimiter*> <*list of strings*>
+```
+
+The path *delimiter* is a string like `/`.
+The *list of strings* is a string like `/usr/bin:/usr/sbin`.
+
+The solution is to find the consecutive intersection of all paths.
+
 # Challenge #3
 
 Find out the synonyms of a given word using the Synonyms API.
-- 
cgit