## Laurent Rosenfeld Weekly Review: Challenge - 007

Sunday, Oct 13, 2019| Tags: Raku

# Raku Solutions Weekly Review

This is derived in part from my blog post made in answer to the Week 7 of the Perl Weekly Challenge organized by Mohammad S. Anwar as well as answers made by others to the same challenge.

Print all the Niven numbers from 0 to 50 inclusive, each on their own line. A Niven number is a non-negative number that is divisible by the sum of its digits.

A Niven number or harshad number is a strictly positive integer that can be evenly divided by the sum of its digits. Note that this property depends on the number base in which the number is expressed (the divisibility property is intrinsic to a pair of numbers, but the sum of digits of a given number depends on the number base in which the number is expressed). Here we will consider only numbers in the common base 10.

Please also note that 0 cannot be a divisor of a number. Therefore, 0 cannot really be a Niven number. We’ll start at 1 to avoid problems.

This is an easy challenge, but I thought it was interesting to include it in this blog series because of the diversity of solutions suggested by the various challengers. Really, there is more than one way to do it..

## My solution

For a simple problem like this, I can’t resist doing in with a Perl 6 one-liner:

​ \$ perl6 -e ‘for 1..50 -> \$num { my \$sum = [+] \$num.comb; say \$num if \$num %% \$sum}’ ​ 1 ​ 2 ​ 3 ​ 4 ​ 5 ​ 6 ​ 7 ​ 8 ​ 9 ​ 10 ​ 12 ​ 18 ​ 20 ​ 21 ​ 24 ​ 27 ​ 30 ​ 36 ​ 40 ​ 42 ​ 45 ​ 48 ​ 50

As it turns out, I’m afraid I was a bit sloppy here (because I simply translated to P6 my original P5 one-liner, instead of taking full advantage of Perl 6 expressive syntax): in Perl 6, the one-liner could be much more concise, as we will see in other challengers’ solutions below.

And it you prefer a real script, this is one way it could be done, using a `gather/take` block:

``````use v6;
.say for gather {
for 1..50 -> \$num {
my \$sum = [+] \$num.comb;
take \$num if \$num %% \$sum
}
}
``````

## Alternative Solutions

Arne Sommer provided a script that could have been a Perl 6 one-liner and is significantly more concise than my own one-liner:

``````.say if \$_ %% \$_.comb.sum for 0 .. 50;
``````

Arne also provided a solution creating a lazy infinite list of Niven numbers and printing out those up to 50:

``````unit sub MAIN (Int \$limit where \$limit > 0 = 50);
my \$niven := gather
{
for 0..Inf
{
take \$_ if \$_ %% \$_.comb.sum;
}
}
.say for \$niven[^\$limit];
``````

This program is sort of slightly wrong, though, as it does not print the Niven numbers up to 50, as required in the challenge specification, but the first 50 Niven numbers (up to 153). But Arne knows that, and that’s really secondary: it would be no big deal to change the last code line to make it satisfy the requirement.

Finley provided a script, but the real code to compute Niven’s number holds in one single line, even slightly shorter than Arne’s solution:

``````.say if (\$_ %% [+] .comb) for 0..50;
``````

Francis J. Whittle also provided a script that could be a simple Perl 6 one-liner:

``````.put for (0..50).grep: { \$_ %% [+] .comb };
``````

Jo-Christian Oterhals‘s script is the most concise so far and could also become a simple one-liner:

``````.say if \$_ %% [+] .comb for 0..50;
``````

Ruben Westerberg also provided a script that could boil down to a one-liner:

``````say join "\n", (0..50) .grep({(\$_ > 0) && \$_ %% (.Str.comb>>.Int .sum)});
``````

Jaldhar H. Vyas dedicated his script to the memory of his father, Dr. Harshad V. Vyas (remember that the Niven numbers are commonly called the Harshad Numbers). His script is significantly longer than all those seen so far (but still fairly short):

``````for 1 .. 50 -> \$number {
if \$number % \$number.comb.sum == 0 {
say \$number;
}
}
``````

Joelle Maslak also wrote a fairly short full-fledged script:

``````sub MAIN(UInt:D \$max = 50) {
for 0..\$max -> \$i {
say \$i if \$i %% [+] \$i.comb;
}
}
``````

Ozzy made the most complicated solution so far:

``````sub SumDigits ( Int \$x is copy ) {
my \$sum=0;
while \$x != 0 {
\$sum += \$x mod 10;
\$x= \$x div 10;
}
return \$sum;
}
sub MAIN {
for 0..50 -> \$x {
say \$x if \$x %% SumDigits(\$x);
}
}
``````

Simon Proctor also somewhat over-engineered it (in my humble view) with multi subroutines :

``````multi sub is-niven( 0 ) { False }

multi sub is-niven( Int \$num where * > 0 ) {
\$num %% [+] \$num.comb;
}
sub MAIN( UInt() \$max=50 ) {
.say if is-niven(\$_) for 0..\$max;
}
``````

Only two blog posts this time:

## Wrapping up

Please let me know if I forgot any of the challengers or if you think my explanation of your code misses something important (you can just raise an issue against this GitHub page).

If you want to participate to the Perl Weekly Challenge, please connect to this site.

## SO WHAT DO YOU THINK ?

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