diff options
| author | Jaime <42359730+bracteatus@users.noreply.github.com> | 2019-06-13 19:20:54 -0600 |
|---|---|---|
| committer | Jaime <42359730+bracteatus@users.noreply.github.com> | 2019-06-13 19:20:54 -0600 |
| commit | f672631668e142626182cffbd82d83898593b565 (patch) | |
| tree | b0c1dd4d8d398470f310dbbaa52b34a0d9297eb6 | |
| parent | 1d8dbac72ec46c91c9441945990ef554600ce928 (diff) | |
| download | perlweeklychallenge-club-f672631668e142626182cffbd82d83898593b565.tar.gz perlweeklychallenge-club-f672631668e142626182cffbd82d83898593b565.tar.bz2 perlweeklychallenge-club-f672631668e142626182cffbd82d83898593b565.zip | |
Create ch-1.pl
| -rw-r--r-- | challenge-012/jaime/perl5/ch-1.pl | 8 |
1 files changed, 8 insertions, 0 deletions
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. + |