github/perlweeklychallenge-club.git/challenge-012/jaime, branch master Unnamed repository; edit this file 'description' to name the repository. Update README 2019-06-14T16:52:51+00:00 Jaime 42359730+bracteatus@users.noreply.github.com 2019-06-14T16:52:51+00:00 730eb94c9c960b1db8f9602436244c8e7cf6be74 






Delete ch-3.pl
2019-06-14T16:38:46+00:00

Jaime
42359730+bracteatus@users.noreply.github.com

2019-06-14T16:38:46+00:00

7addcee613f5da8cd848246b10677326ba011a1c












Update ch-2.pl
2019-06-14T14:52:16+00:00

Jaime
42359730+bracteatus@users.noreply.github.com

2019-06-14T14:52:16+00:00

31637ba5aad2a8ad7767c7ebeed9e760de7b7b8a

Use REGEX extraction to find intersections of paths.





Use REGEX extraction to find intersections of paths.







Update ch-1.pl
2019-06-14T12:33:25+00:00

Jaime
42359730+bracteatus@users.noreply.github.com

2019-06-14T12:33:25+00:00

b3aeb665d757158d9c558169b9d791537cb44f96

Iterate primorial numbers to find the first Euclid number that is not prime.





Iterate primorial numbers to find the first Euclid number that is not prime.







Create ch-3.pl
2019-06-14T01:21:00+00:00

Jaime
42359730+bracteatus@users.noreply.github.com

2019-06-14T01:21:00+00:00

102c2efaaf6504f06120cb03f537e1964b229ead












Create ch-2.pl
2019-06-14T01:20:58+00:00

Jaime
42359730+bracteatus@users.noreply.github.com

2019-06-14T01:20:58+00:00

c40f4a63c65ee34e3ec96197559b8c90e783a1e6












Create ch-1.pl
2019-06-14T01:20:54+00:00

Jaime
42359730+bracteatus@users.noreply.github.com

2019-06-14T01:20:54+00:00

f672631668e142626182cffbd82d83898593b565












Update README
2019-06-14T01:15:43+00:00

Jaime
42359730+bracteatus@users.noreply.github.com

2019-06-14T01:15:43+00:00

1d8dbac72ec46c91c9441945990ef554600ce928












- Added template for Challenge 012.
2019-06-10T05:03:50+00:00

Mohammad S Anwar
mohammad.anwar@yahoo.com

2019-06-10T05:03:50+00:00

2a6d35e8a8cea34af73071439ae06c6c11311f3e