From f672631668e142626182cffbd82d83898593b565 Mon Sep 17 00:00:00 2001
From: Jaime <42359730+bracteatus@users.noreply.github.com>
Date: Thu, 13 Jun 2019 19:20:54 -0600
Subject: Create ch-1.pl

---
 challenge-012/jaime/perl5/ch-1.pl | 8 ++++++++
 1 file changed, 8 insertions(+)
 create mode 100644 challenge-012/jaime/perl5/ch-1.pl

diff --git a/challenge-012/jaime/perl5/ch-1.pl b/challenge-012/jaime/perl5/ch-1.pl
new file mode 100644
index 0000000000..3ecead2762
--- /dev/null
+++ b/challenge-012/jaime/perl5/ch-1.pl
@@ -0,0 +1,8 @@
+# Solution by Jaime Corchado, (@tortsnare)[https://twitter.com/tortsnare].
+#
+# Challenge #1
+#
+# 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.
+
-- 
cgit