The Weekly Challenge - 171

Monday, Jun 27, 2022| Tags: Perl, Raku

TABLE OF CONTENTS


01. HEADLINES

02. SPONSOR

03. RECAP

04. PERL REVIEW

05. RAKU REVIEW

06. CHART

07. NEW MEMBERS

08. GUESTS

09. TASK #1: Abundant Number

10. TASK #2: First-class Function


HEADLINES


Welcome to Week #171 of the weekly challenge.

Let us all welcome another experienced Perl hacker from France, Philippe Bricout. You should definitely checkout his Perl solution.

Welcome back, Mark Senn and thanks for your contribution in Raku.

Welcome back Cristina Heredia and thank you for your contributions in Perl and Python.

E. Choroba shared link about his discussion he initiated on PerlMonks. It is worth taking a look, plenty of new ideas shared.

Thank you, Stephen G Lynn for sharing his first blog post.

At last, I found the time to take part in the weekly challenge and shared solutions in Perl, Raku and Python.

With regard to the 1000 days celebration update, I have reached out to the recently declared champions i.e. Alexander Pankoff, Robert DiCicco, Eric Cheung, Matthew Neleigh and Robert Ransbottom. It is likely I am going to add one more champion to the list, to be declared next week. I will give them couple of weeks to respond to my email. And then the final list would be prepared.

Good luck for the next challenge.


Blogs with Creative Title


1. The Primorial Soup by Arne Sommer.

2. A Deep, Primorial Fear by Colin Crain.

3. Kronecker? I hardly knew her! by Colin Crain.

4. primordial matrix! by Luca Ferrari.

5. Kronecker’s Primorial by Roger Bell_West.


GitHub Repository Stats


1. Commits: 26,196 (+176)

2. Pull Requests: 6,339 (+48)

3. Contributors: 199 (+2)

4. Fork: 252 (+1)

5. Stars: 140 (+2)



Our solo sponsor Pete Sergeant has been a great support to keep us motivated. We are lucky that he agreed to continue the journey with us in the year 2022. I would like to personally thank Pete and his entire team for their generosity. It would be great if we could add few more to sponsor the prize money so that we could go back and declare weekly champions as we have done in the past. I hope and wish this will become possible in 2022. The amount doesn’t have to be huge. However, it would be nice to show off bunch of supporters. If an organisation comes forward and supports us then that would be the ultimate achievement.


RECAP


Quick recap of The Weekly Challenge - 170 by Mohammad S Anwar.


PERL REVIEW


Please check out Perl solutions review of The Weekly Challenge - 165 by Colin Crain.

If you missed any past reviews then please check out the collection.


RAKU REVIEW


If you missed any past reviews then please check out 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


Philippe Bricout, an experienced Perl hacker from France.


Please find out How to contribute?, if you have any doubts.

Please try the excellent tool EZPWC created by respected member Saif Ahmed of Team PWC.


GUESTS


Please checkout the guest contributions for the Week #170.

Please find past solutions by respected guests. Please share your creative solutions in other languages.


Task 1: Abundant Number

Submitted by: Mohammad S Anwar

Write a script to generate first 20 Abundant Odd Numbers.

According to wikipedia,


A number n for which the sum of divisors σ(n) > 2n, or, equivalently, the sum of proper divisors (or aliquot sum) s(n) > n.


For example, 945 is the first Abundant Odd Number.

Sum of divisors:
1 + 3 + 5 + 7 + 9 + 15 + 21 + 27 + 35 + 45 + 63 + 105 + 135 + 189 + 315 = 975

Task 2: First-class Function

Submitted by: Mohammad S Anwar

Create sub compose($f, $g) which takes in two parameters $f and $g as subroutine refs and returns subroutine ref i.e. compose($f, $g)->($x) = $f->($g->($x))


e.g.

$f = (one or more parameters function)
$g = (one or more parameters function)

$h = compose($f, $g)
$f->($g->($x,$y, ..)) == $h->($x, $y, ..) for any $x, $y, ...


Last date to submit the solution 23:59 (UK Time) Sunday 3rd July 2022.


SO WHAT DO YOU THINK ?

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

Contact with me