Perl Weekly Challenge - 015

Sunday, Jun 30, 2019| Tags: Perl, Raku

Let me announce the winner of Perl Weekly Challenge - 014 and the name is Jaldhar H. Vyas. Many congratulations to Jaldhar. You should soon hear from Perl Careers about your reward. Please do let us know how you feel about it. For rest of the participants, I would say Good Luck for next time. Keep sending in your solutions and share your knowledge with each other.


Here is the recap of last week challenge.


Please take a look at the charts showing interesting data.

I would like to thank everyone for their valuable suggestions. Please do share your experience with us. Good luck for the weekly challenge and enjoy.


  1. Robert Van Dam, experienced Perl hacker.

  2. Walt Mankowski, lives in the Philadelphia area and ran the Philadelphia Perl Mongers for many years. He has been using Perl since 1995 and he has attended all but 2 of the YAPC/TPC conferences held in North America. He loves Perl of course, but also program in Python, C and C++, Matlab, and he has even done COBOL back in the day.

  3. Roger Bell West, experienced Perl hacker. We both worked on Tusker project for a consultancy firm Torrington in London many years ago.

  4. Duane Powell, experienced Perl hacker from Dallas, Texas, USA. He has been using Perl for systems administration and file wrangling for the computer animation industry since 1999.

  5. Shaun Pearce, experienced Perl hacker from South Africa. He has been a programmer for 10 years. Mostly C, but Perl for freeradius and Python for server management.

  6. Noud, Dutch, just started learning Raku. These challenges will be a great opportunity to learn Raku quick. Fluent in several other languages, including Dutch.

  7. Nikhil Prasanna, experienced Perl hacker.

Check out other team members.

Task #1

Write a script to generate first 10 strong and weak prime numbers.

  For example, the nth prime number is represented by p(n).

  p(1) = 2
  p(2) = 3
  p(3) = 5
  p(4) = 7
  p(5) = 11

  Strong Prime number p(n) when p(n) > [ p(n-1) + p(n+1) ] / 2
  Weak   Prime number p(n) when p(n) < [ p(n-1) + p(n+1) ] / 2

Task #2

Write a script to implement Vigenère cipher. The script should be able encode and decode. Checkout wiki page for more information.

Task #3

Write a script to use Language Detection API. For more information about API, please visit page. The API task is optional but we would love to see your solution.

Last date to submit the solution 23:59 (UK Time) Sunday 7th July 2019.


If you have any suggestions or ideas then please do share with us.

Contact with me