HEADLINES
With great pleasure, we announce Noud Aldenhoven** as the winner of “Perl Weekly Challenge - 040”**. Congratulations Noud, you should soon hear from Perl Careers about your reward. 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.
RECAP
Here is the recap of last week “Perl Weekly Challenge - 040”.
PERL REVIEW
Please checkout Perl** solutions review of the “Perl Weekly Challenge - 039”** by Kian-Meng Ang.
If you missed any past reviews then please checkout the collection.
RAKU REVIEW
Please checkout Raku** solutions review of the “Perl Weekly Challenge - 039”** by Laurent Rosenfeld.
If you missed any past reviews then please checkout the collection.
CHART
Please take a look at the charts showing interesting data.
I would like to thank every member of the team for their valuable suggestions. Please do share your experience with us.
NEW MEMBERS
Last week, someone with GitHub username wanderdoc joined the team and shared his/her first contributions. wanderdoc even shared solutions in R.
Check out current team members.
Please find out How to contribute?, if you have any doubts.
GUESTS
Burkhard Nickels shared solutions to Task #1 and Task #2 in Python.
Lubos Kolouch shared solutions to Task #1 and Task #2 in Python.
Ulrich Rieke shared solutions to Task #1 and Task #2 in Haskell.
Ulrich Rieke shared solutions to Task #1 and Task #2 in C++.
Wanderdoc shared solutions to Task #1 and Task #2 in R.
Please find out past solutions by respected guests. Please do share your creative solutions in other languages.
TASK #1
Write a script to display attractive number between 1 and 50.
A number is an attractive number if the number of its prime factors is also prime number.
The number 20 is an attractive number, whose prime factors are 2, 2 and 5. The total prime factors is 3 which is also a prime number.
TASK #2
Write a script to display first 20 Leonardo Numbers. Please checkout wiki page for more information.
For example:
L(0) = 1
L(1) = 1
L(2) = L(0) + L(1) + 1 = 3
L(3) = L(1) + L(2) + 1 = 5
and so on.
Last date to submit the solution 23:59 (UK Time) Sunday 5th January 2020.